238 search results - page 20 / 48 » Value-Function Approximations for Partially Observable Marko... |
IJCAI
2007
15 years 1 months ago
2007
Computers have already eclipsed the level of human play in competitive Scrabble, but there remains room for improvement. In particular, there is much to be gained by incorporating...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
The success of probabilistic model checking for discrete-time Markov decision processes and continuous-time Markov chains has led to rich academic and industrial applications. The ...
PERCOM
2007
ACM
15 years 11 months ago
2007
ACM
We consider sensor scheduling as the optimal observability problem for partially observable Markov decision processes (POMDP). This model fits to the cases where a Markov process ...
107
click to vote
IAT
2005
IEEE
15 years 5 months ago
2005
IEEE
Partially observable Markov decision process (POMDP) is commonly used to model a stochastic environment with unobservable states for supporting optimal decision making. Computing ...
NIPS
2007
15 years 1 months ago
2007
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...