110 search results - page 1 / 22 » Interleaved Depth-First Search |
IJCAI
1997
13 years 6 months ago
1997
In tree search, depth-first search (DFS) often uses ordering successor heuristics. If the heuristic makes a mistake ordering a bad successor (without goals in its subtree) before ...
ICTAI
1992
IEEE
13 years 9 months ago
1992
IEEE
AUSAI
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. Planning-specific heuristics for SAT have recently been shown to produce planners that match best earlier ones that use other search methods, including the until now dom...
AAAI
2010
13 years 6 months ago
2010
The depth first proof number search (df-pn) is an effective and popular algorithm for solving and-or tree problems by using proof and disproof numbers. This paper presents a simpl...
WECWIS
2009
IEEE
13 years 11 months ago
2009
IEEE
—The goal of the Web Service Composition (WSC) problem is to find an optimal composition of web services to satisfy a given request using their syntactic and/or semantic feature...