206 search results - page 17 / 42 » Learning Heuristic Functions from Relaxed Plans |
ATMOS
2007
14 years 11 months ago
2007
In this paper we study a general formulation of the train platforming problem, which contains as special cases all the versions previously considered in the literature as well as a...
GECCO
2007
Springer
15 years 1 months ago
2007
Springer
In this study we deal with the mixing problem, which concerns combining the prediction of independently trained local models to form a global prediction. We deal with it from the ...
110
click to vote
CDC
2008
IEEE
14 years 10 months ago
2008
IEEE
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in control theory, machine learning, and discrete geometry. This c...
IJCAI
2001
14 years 11 months ago
2001
This paper describes an algorithm for solving large state-space MDPs (represented as factored MDPs) using search by successive refinement in the space of non-homogeneous partition...
IROS
2006
IEEE
15 years 3 months ago
2006
IEEE
This work is about the relevance of Gibson’s concept of affordances [1] for visual perception in interactive and autonomous robotic systems. In extension to existing functional ...