656 search results - page 6 / 132 » Complexity of finite-horizon Markov decision process problem... |
123
click to vote
DAC
2000
ACM
16 years 20 days ago
2000
ACM
In this paper, we introduce a new technique for modeling and solving the dynamic power management (DPM) problem for systems with complex behavioral characteristics such as concurr...
100
click to vote
AAAI
2006
15 years 1 months ago
2006
Despite the significant progress to extend Markov Decision Processes (MDP) to cooperative multi-agent systems, developing approaches that can deal with realistic problems remains ...
AAAI
2007
15 years 2 months ago
2007
Planning under uncertainty involves two distinct sources of uncertainty: uncertainty about the effects of actions and uncertainty about the current state of the world. The most wi...
UAI
1998
15 years 1 months ago
1998
Recent research in decision theoretic planning has focussedon making the solution of Markov decision processes (MDPs) more feasible. We develop a family of algorithms for structur...
ML
2002
ACM
14 years 11 months ago
2002
ACM
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...