...
首页> 外文期刊>Optimization: A Journal of Mathematical Programming and Operations Research >A dynamic programming approach for finite Markov processes and algorithms for the calculation of the limit matrix in Markov chains
【24h】

A dynamic programming approach for finite Markov processes and algorithms for the calculation of the limit matrix in Markov chains

机译:有限马尔可夫过程的动态规划方法和马尔可夫链中极限矩阵的计算算法

获取原文
获取原文并翻译 | 示例
           

摘要

New calculation procedures for finding the probabilities of state transitions of the system in discrete Markov processes 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.
机译:提出了一种基于动态规划的离散马尔可夫过程寻找系统状态转移概率的新计算程序,并提出了确定过程中极限状态矩阵的多项式时间算法。表征了计算复杂性方面以及所提出算法用于随机优化问题的可能应用。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号