13 search results - page 2 / 3 » Using Lookaheads with Optimal Best-First Search |
ATAL
2006
Springer
13 years 9 months ago
2006
Springer
Deciding what to branch on at each node is a key element of search algorithms. We present four families of methods for selecting what question to branch on. They are all informati...
CP
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. This paper evaluates the power of a new scheme that generates search heuristics mechanically. This approach was presented and evaluated rst in the context of optimization...
CGI
2000
IEEE
13 years 9 months ago
2000
IEEE
We present a system for the animation of human hand that plays violin. Neural network controls the hand movement. We make use of an optimization method to generate the examples fo...
JAIR
2011
13 years 8 days ago
2011
Current evaluation functions for heuristic planning are expensive to compute. In numerous planning problems these functions provide good guidance to the solution, so they are wort...
NIPS
2007
13 years 6 months ago
2007
Planning in partially observable environments remains a challenging problem, despite significant recent advances in offline approximation techniques. A few online methods have a...