771 search results - page 57 / 155 » Markov Decision Processes with Arbitrary Reward Processes |
149
click to vote
IJCAI
2007
15 years 5 months ago
2007
Dynamic programming algorithms provide a basic tool identifying optimal solutions in Markov Decision Processes (MDP). The paper develops a representation for decision diagrams sui...
132
click to vote
ACL
2000
15 years 5 months ago
2000
Spoken dialogue managers have benefited from using stochastic planners such as Markov Decision Processes (MDPs). However, so far, MDPs do not handle well noisy and ambiguous speec...
130
click to vote
ICML
2005
IEEE
16 years 4 months ago
2005
IEEE
Several algorithms for learning near-optimal policies in Markov Decision Processes have been analyzed and proven efficient. Empirical results have suggested that Model-based Inter...
145
Voted
VMCAI
2010
Springer
16 years 1 months ago
2010
Springer
This paper investigates relative precision and optimality of analyses for concurrent probabilistic systems. Aiming at the problem at the heart of probabilistic model checking ? com...
140
click to vote
ICRA
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract— We provide a method for planning under uncertainty for robotic manipulation by partitioning the configuration space into a set of regions that are closed under complia...