288 search results - page 33 / 58 » Risk-averse dynamic programming for Markov decision processe... |
90
Voted
CORR
2006
Springer
14 years 11 months ago
2006
Springer
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
GECCO
2004
Springer
15 years 5 months ago
2004
Springer
Genetic programming may be seen as a recent incarnation of a long-held goal in evolutionary computation: to develop actual computational devices through evolutionary search. Geneti...
NIPS
2007
15 years 1 months ago
2007
We present an algorithm called Optimistic Linear Programming (OLP) for learning to optimize average reward in an irreducible but otherwise unknown Markov decision process (MDP). O...
ATAL
2006
Springer
15 years 3 months ago
2006
Springer
Developing scalable algorithms for solving partially observable Markov decision processes (POMDPs) is an important challenge. One promising approach is based on representing POMDP...
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...