科研之友
微信
新浪微博
Facebook
分享链接
摘要
We prove new iterative algorithms to provide component-wise bounds of the steady-state distribution of an irreducible and aperiodic Markov chain. These bounds are based on simple properties of (max, +) and (min, +) sequences. The bounds are improved at each iteration. Thus, we have a clear trade-off between tightness of the bounds (some algorithms converge to the true solution) and computation times.
- 出版日期2011-11
- 单位INRIA
