1047 search results - page 57 / 210 » Searching Without a Heuristic: Efficient Use of Abstraction |
AIPS
2000
13 years 9 months ago
2000
Planners from the family of Graphplan (Graphplan, IPP, STAN...) are presently considered as the most efficient ones on numerous planning domains. Their partially ordered plans can...
WAIM
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Most users of the WWW want their searches to be effective. Currently, there exists a wide variety of efficient syntactic tools that have can be used for search in the WWW...
ESCIENCE
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract. We study the implementation on grid systems of an efficient algorithm for demanding global optimization problems. Specifically, we consider problems arising in the geneti...
MMB
2010
Springer
14 years 17 days ago
2010
Springer
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
ICRA
2009
IEEE
13 years 5 months ago
2009
IEEE
Abstract-- Existing high-dimensional motion planning algorithms are simultaneously overpowered and underpowered. In domains sparsely populated by obstacles, the heuristics used by ...