682 search results - page 66 / 137 » One-Counter Markov Decision Processes |
101
click to vote
ATAL
2008
Springer
15 years 3 months ago
2008
Springer
The ability for an agent to reason under uncertainty is crucial for many planning applications, since an agent rarely has access to complete, error-free information about its envi...
135
click to vote
PRICAI
2000
Springer
15 years 4 months ago
2000
Springer
This paper presents the CQ algorithm which decomposes and solves a Markov Decision Process (MDP) by automatically generating a hierarchy of smaller MDPs using state variables. The ...
116
click to vote
ATAL
2010
Springer
15 years 2 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...
140
click to vote
ECML
2007
Springer
15 years 3 months ago
2007
Springer
Many problems in areas such as Natural Language Processing, Information Retrieval, or Bioinformatic involve the generic task of sequence labeling. In many cases, the aim is to assi...
135
Voted
ICML
1995
IEEE
16 years 1 months ago
1995
IEEE
Partially observable Markov decision processes (pomdp's) model decision problems in which an agent tries to maximize its reward in the face of limited and/or noisy sensor fee...