A Revised Stochastic Complementation Algorithm for Nearly Completely Decomposable Markov Chains.
R. Bruce MattinglyPublished in: INFORMS J. Comput. (1995)
Keyphrases
- markov chain
- monte carlo
- learning algorithm
- markov model
- matching algorithm
- optimal solution
- objective function
- k means
- dynamic programming
- monte carlo simulation
- markov processes
- sufficient conditions
- machine learning
- transition probabilities
- finite state automata
- conflict free
- transition matrix
- probabilistic automata
- algo rithm