656 search results - page 22 / 132 » Complexity of finite-horizon Markov decision process problem... |
120
click to vote
ATAL
2010
Springer
15 years 3 months ago
2010
Springer
In this paper, we study a particular subclass of partially observable models, called quasi-deterministic partially observable Markov decision processes (QDET-POMDPs), characterize...
195
click to vote
Publication
We introduce a class of learning problems where the agent is presented with a series of tasks. Intuitively, if there is relation among those tasks, then the information gained duri...
141
Voted
IEEEARES
2006
IEEE
15 years 7 months ago
2006
IEEE
Failure diagnosis in large and complex systems is a critical task. A discrete event system (DES) approach to the problem of failure diagnosis is presented in this paper. A classic...
112
Voted
AAAI
1997
15 years 3 months ago
1997
Markov Decision Processes (MDPs), currently a popular method for modeling and solving decision theoretic planning problems, are limited by the Markovian assumption: rewards and dy...
115
Voted
ICC
2007
IEEE
15 years 8 months ago
2007
IEEE
We consider opportunistic spectrum access for secondary users over multiple channels whose occupancy by primary users is modeled as discrete-time Markov processes. Due to hardware...