|
Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, 2011, номер 1, страницы 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
Аннотация:
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.
Ключевые слова и фразы:
discrete Markov process, probability of state transition, limit state matrix, dynamic programming, polynomial time algorithm.
Поступила в редакцию: 06.10.2010
Образец цитирования:
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
Образцы ссылок на эту страницу:
https://www.mathnet.ru/rus/basm281 https://www.mathnet.ru/rus/basm/y2011/i1/p66
|
|