Some new algorithms for QBDs and block M/G/1 and GI/M/1 Markov chains / Emma Thea Hasmik Hunt.
dc.contributor.author | Hunt, Emma (Emma Thea Hasmik) | en |
dc.contributor.school | Dept. of Applied Mathematics | en |
dc.date.issued | 2002 | en |
dc.description | "July 12, 2002" | en |
dc.description | Bibliography: p. 130-137 | en |
dc.description | viii, 160 leaves ; 30 cm. | en |
dc.description.dissertation | Thesis (Ph.D.)--University of Adelaide, Dept. of Applied Mathematics, 2002 | en |
dc.format.extent | 94348 bytes | en |
dc.format.mimetype | application/pdf | en |
dc.identifier.uri | http://hdl.handle.net/2440/21850 | |
dc.language.iso | en | en |
dc.provenance | This electronic version is made publicly available by the University of Adelaide in accordance with its open access policy for student theses. Copyright in this thesis remains with the author. This thesis may incorporate third party material which has been used by the author pursuant to Fair Dealing exception. If you are the author of this thesis and do not wish it to be made publicly available or If you are the owner of any included third party copyright material you wish to be removed from this electronic version, please complete the take down form located at: http://www.adelaide.edu.au/legals | en |
dc.subject.lcsh | Markov processes. | en |
dc.subject.lcsh | Algorithms. | en |
dc.subject.lcsh | System theory. | en |
dc.subject.lcsh | Stochastic processes. | en |
dc.title | Some new algorithms for QBDs and block M/G/1 and GI/M/1 Markov chains / Emma Thea Hasmik Hunt. | en |
dc.title.alternative | Some new algorithms for quasi-birth-and-death processes and block M/G/1 and GI/M/1 Markov chains | en |
dc.type | Thesis | en |