| dc.contributor.author | Yazidi, Anis | |
| dc.contributor.author | Granmo, Ole-Christoffer | |
| dc.contributor.author | Oommen, B. John | |
| dc.date.accessioned | 2012-01-19T12:04:51Z | |
| dc.date.available | 2012-01-19T12:04:51Z | |
| dc.date.issued | 2011 | |
| dc.identifier.citation | Yazidi, A., Granmo, O. C., & Oommen, B. J. (2011). On the analysis of a new Markov chain which has applications in AI and machine learning 2011 24th Canadian Conference on Electrical and Computer Engineering (CCECE), (pp. 553-1558): IEEE. | no_NO |
| dc.identifier.isbn | 978-1-4244-9789-8 | |
| dc.identifier.uri | http://hdl.handle.net/11250/137920 | |
| dc.description | Accepted version of an article from the conference: 2011 24th Canadian Conference on Electrical and Computer Engineering. Published version available from IEEE: http://dx.doi.org/10.1109/CCECE.2011.6030727 | no_NO |
| dc.description.abstract | In this paper, we consider the analysis of a fascinating Random Walk (RW) that contains interleaving random steps and random "jumps". The characterizing aspect of such a chain is that every step is paired with its counterpart random jump. RWs of this sort have applications in testing of entities, where the entity is never allowed to make more than a pre-specified number of consecutive failures. This paper contains the analysis of the chain, some fascinating limiting properties, and some initial simulation results. The reader will find more detailed results in [12]. | no_NO |
| dc.publisher | IEEE | no_NO |
| dc.title | On the analysis of a new Markov chain which has applications in AI and machine learning | no_NO |
| dc.type | Chapter | no_NO |
| dc.type | Peer reviewed | no_NO |
| dc.subject.nsi | VDP::Mathematics and natural science: 400::Mathematics: 410::Applied mathematics: 413 | no_NO |
| dc.subject.nsi | VDP::Technology: 500::Information and communication technology: 550 | no_NO |
| dc.source.pagenumber | 553-558 | no_NO |
