1639 search results - page 88 / 328 » Anytime Heuristic Search |
80
Voted
ECAI
2000
Springer
15 years 5 months ago
2000
Springer
Case-based reasoning (CBR) aims at using experience from the past in order to guide future problem solving rather than “starting from scratch” every time. We propose a CBR stra...
102
click to vote
KI
2001
Springer
15 years 5 months ago
2001
Springer
Having to cope with memory limitations is an ubiquitous issue in heuristic search. We present theoretical and practical results on new variants for exploring state-space with respe...
86
Voted
IJCAI
1997
15 years 1 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 ...
GIS
2002
ACM
15 years 11 days ago
2002
ACM
This papers deals with multiway spatial joins when (i) there is limited time for query processing and the goal is to retrieve the best possible solutions within this limit (ii) the...
111
Voted
CP
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...