656 search results - page 93 / 132 » Complexity of finite-horizon Markov decision process problem... |
159
click to vote
TASE
2011
IEEE
14 years 8 months ago
2011
IEEE
: This paper addresses the dynamic pricing problem of a single-item, make-to-stock production system. Demand arrives according to Poisson processes with changeable arrival rate dep...
132
click to vote
ATAL
2008
Springer
15 years 3 months ago
2008
Springer
Decentralized partially observable Markov decision processes (Dec-POMDPs) constitute an expressive framework for multiagent planning under uncertainty, but solving them is provabl...
104
click to vote
ICML
2003
IEEE
16 years 2 months ago
2003
IEEE
We investigate methods for planning in a Markov Decision Process where the cost function is chosen by an adversary after we fix our policy. As a running example, we consider a rob...
CDC
2008
IEEE
15 years 8 months ago
2008
IEEE
—A material handling (MH) system of a general assembly line dispatching parts from inventory to working buffers could be complicated and costly to operate. Generally it is extrem...
117
click to vote
ATAL
2007
Springer
15 years 8 months ago
2007
Springer
Optimal resource scheduling in multiagent systems is a computationally challenging task, particularly when the values of resources are not additive. We consider the combinatorial ...