201 search results - page 7 / 41 » Incremental Algorithms for Approximate Compilation |
106
Voted
JCP
2007
14 years 9 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...
DATE
2002
IEEE
15 years 2 months ago
2002
IEEE
As system integration evolves and tighter design constraints must be met, it becomes necessary to account for the non-ideal behavior of all the elements in a system. For high-spee...
PKDD
2009
Springer
15 years 4 months ago
2009
Springer
The goal of approximate policy evaluation is to “best” represent a target value function according to a specific criterion. Temporal difference methods and Bellman residual m...
ICRA
2008
IEEE
15 years 4 months ago
2008
IEEE
— We are interested in transferring control policies for arbitrary tasks from a human to a robot. Using interactive demonstration via teloperation as our transfer scenario, we ca...
ICIG
2009
IEEE
14 years 7 months ago
2009
IEEE
In this paper, we present an efficient and robust subspace learning based object tracking algorithm with special illumination handling. Illumination variances pose a great challen...