2005 search results - page 209 / 401 » Decisive Markov Chains |
145
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...
111
click to vote
AAAI
2010
15 years 3 months ago
2010
Relational Markov Decision Processes (MDP) are a useraction for stochastic planning problems since one can develop abstract solutions for them that are independent of domain size ...
128
click to vote
AAAI
1994
15 years 3 months ago
1994
We present new algorithms for local planning over Markov decision processes. The base-level algorithm possesses several interesting features for control of computation, based on s...
106
click to vote
ATAL
2010
Springer
15 years 2 months ago
2010
Springer
Partially Observable Markov Decision Process (POMDP) is a popular framework for planning under uncertainty in partially observable domains. Yet, the POMDP model is riskneutral in ...
107
click to vote
JAIR
2008
15 years 1 months ago
2008
Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP i...