A dynamic programming approach for finite Markov processes and algorithms for the calculation of the limit matrix in Markov chains (Q3111140): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1080/02331934.2011.627333 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2086291584 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Scientific Applications: An algorithm for identifying the ergodic subchains and transient states of a stochastic matrix / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimization and Multiobjective Control of Time-Discrete Systems / rank | |||
Normal rank |
Latest revision as of 21:08, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A dynamic programming approach for finite Markov processes and algorithms for the calculation of the limit matrix in Markov chains |
scientific article |
Statements
A dynamic programming approach for finite Markov processes and algorithms for the calculation of the limit matrix in Markov chains (English)
0 references
18 January 2012
0 references
discrete Markov process
0 references
probability of state transition
0 references
limit state matrix
0 references
dynamic prgramming
0 references
polynomial time algorithm
0 references