|
Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, 2011, Number 1, Pages 66–82
(Mi basm281)
|
|
|
|
Research articles
Algorithms for determining the state-time probabilities and the limit matrix in Markov chains
Dmitrii Lozovanua, Stefan Picklb a Institute of Mathematics and Computer Science, Academy of Sciences of Moldova, Chişnău, Moldova
b Institut fur Angewandte Systemwissenschaften und Wirtschaftsinformatik, Fakultät fur Informatik, Universität der Bundeswehr, München
Abstract:
New calculation procedures for finding the probabilities of state transitions of the system in Markov chains based on dynamic programming are developed and polynomial time algorithms for determining the limit state matrix in such processes are proposed. Computational complexity aspects and possible applications of the proposed algorithms for the stochastic optimization problems are characterized.
Keywords and phrases:
discrete Markov process, probability of state transition, limit state matrix, dynamic programming, polynomial time algorithm.
Received: 06.10.2010
Citation:
Dmitrii Lozovanu, Stefan Pickl, “Algorithms for determining the state-time probabilities and the limit matrix in Markov chains”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2011, no. 1, 66–82
Linking options:
https://www.mathnet.ru/eng/basm281 https://www.mathnet.ru/eng/basm/y2011/i1/p66
|
Statistics & downloads: |
Abstract page: | 307 | Full-text PDF : | 45 | References: | 34 | First page: | 2 |
|