34 search results - page 2 / 7 » Sparse Approximate Dynamic Programming for Dialog Management |
NIPS
2007
13 years 7 months ago
2007
We combine three threads of research on approximate dynamic programming: sparse random sampling of states, value function and policy approximation using local models, and using lo...
SODA
2008
ACM
13 years 7 months ago
2008
ACM
We develop a framework for obtaining Fully Polynomial Time Approximation Schemes (FPTASs) for stochastic univariate dynamic programs with either convex or monotone single-period c...
CISS
2008
IEEE
14 years 7 days ago
2008
IEEE
—Beyond signal processing applications, frames are also powerful tools for modeling the sensing and information processing of many biological and man-made systems that exhibit in...
JCP
2007
13 years 5 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...
EOR
2006
13 years 5 months ago
2006
In this paper, we present a stochastic model for the dynamic fleet management problem with random travel times. Our approach decomposes the problem into time-staged subproblems by...