1277 search results - page 82 / 256 » Terminating Decision Algorithms Optimally |
157
click to vote
NIPS
2008
15 years 5 months ago
2008
Research in animal learning and behavioral neuroscience has distinguished between two forms of action control: a habit-based form, which relies on stored action values, and a goal...
121
click to vote
AIPS
2003
15 years 5 months ago
2003
We develop a hierarchical approach to planning for partially observable Markov decision processes (POMDPs) in which a policy is represented as a hierarchical finite-state control...
164
click to vote
AOR
2010
15 years 1 months ago
2010
We show how a technique from signal processing known as zero-delay convolution can be used to develop more efficient dynamic programming algorithms for a broad class of stochastic...
141
Voted
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
Decentralized Markov Decision Processes (DEC-MDPs) are a popular model of agent-coordination problems in domains with uncertainty and time constraints but very difficult to solve...
142
Voted
CEC
2010
IEEE
15 years 5 months ago
2010
IEEE
Many-objective problems are difficult to solve using conventional multi-objective evolutionary algorithms (MOEAs) as these algorithms rely primarily on Pareto ranking to guide the ...