508 search results - page 26 / 102 » Learning for stochastic dynamic programming |
SAC
2009
ACM
15 years 9 months ago
2009
ACM
We present a modular approach to implement adaptive decisions with existing scientific codes. Using a sophisticated system software tool based on the function call interception t...
102
click to vote
NIPS
2007
15 years 3 months ago
2007
Most models of decision-making in neuroscience assume an infinite horizon, which yields an optimal solution that integrates evidence up to a fixed decision threshold; however, u...
116
click to vote
AAAI
2004
15 years 3 months ago
2004
The search for finite-state controllers for partially observable Markov decision processes (POMDPs) is often based on approaches like gradient ascent, attractive because of their ...
119
click to vote
CDC
2009
IEEE
15 years 7 months ago
2009
IEEE
—TD learning and its refinements are powerful tools for approximating the solution to dynamic programming problems. However, the techniques provide the approximate solution only...
142
click to vote
JCP
2007
15 years 2 months ago
2007
Abstract— We describe a general method to transform a non-Markovian sequential decision problem into a supervised learning problem using a K-bestpaths algorithm. We consider an a...