Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Patupat, Albert John Lalim"'
This paper addresses the problem of finding a minimum-cost $m$-state Markov chain $(S_0,\ldots,S_{m-1})$ in a large set of chains. The chains studied have a reward associated with each state. The cost of a chain is its "gain", i.e., its average rewar
Externí odkaz:
http://arxiv.org/abs/2401.11622
