Using the Manhattan distance for computing the multiobjective Markov chains problem.
Julio B. ClempnerAlexander S. PoznyakPublished in: Int. J. Comput. Math. (2018)
Keyphrases
- markov chain
- multi objective
- manhattan distance
- steady state
- transition probabilities
- markov process
- finite state
- markov processes
- evolutionary algorithm
- markov model
- stationary distribution
- random walk
- euclidean distance
- state space
- particle swarm optimization
- probabilistic automata
- genetic algorithm
- confidence intervals
- query language
- objective function
- neural network