334 search results - page 14 / 67 » How to Dynamically Merge Markov Decision Processes |
90
Voted
NIPS
2000
15 years 1 months ago
2000
We propose a method of approximate dynamic programming for Markov decision processes (MDPs) using algebraic decision diagrams (ADDs). We produce near-optimal value functions and p...
115
click to vote
JAIR
2002
15 years 6 days ago
2002
Hidden Markov models hmms and partially observable Markov decision processes pomdps provide useful tools for modeling dynamical systems. They are particularly useful for represent...
98
Voted
IJCAI
2003
15 years 1 months ago
2003
We present a new algorithm, GM-Sarsa(0), for finding approximate solutions to multiple-goal reinforcement learning problems that are modeled as composite Markov decision processe...
86
Voted
AIPS
2006
15 years 1 months ago
2006
This paper presents an adaptation of the standard quantum search technique to enable application within Dynamic Programming, in order to optimise a Markov Decision Process. This i...
101
Voted
IJVR
2008
15 years 16 days ago
2008
Museums like marine aquariums are facing a difficult problem when trying to deliver information to their visitors. The exhibits they propose are dynamic by definition. Each may con...