Sciweavers

1402 search results - page 120 / 281
» Sparse-Memory Graph Search
Sort
View
AIPS
2000
14 years 11 months ago
DPPlan: An Algorithm for Fast Solutions Extraction from a Planning Graph
Themostefficient planning algorithms recently developed are mainly based on Graphplansystem or on satisfiability approach. In this paper wepresent a new approach to plan generatio...
Marco Baioletti, Stefano Marcugini, Alfredo Milani
AAAI
1990
14 years 11 months ago
Some Applications of Graph Bandwidth to Constraint Satisfaction Problems
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
Ramin Zabih
IDA
2007
Springer
14 years 10 months ago
Inference of node replacement graph grammars
Graph grammars combine the relational aspect of graphs with the iterative and recursive aspects of string grammars, and thus represent an important next step in our ability to dis...
Jacek P. Kukluk, Lawrence B. Holder, Diane J. Cook
IC
2003
14 years 11 months ago
Metasearch Via the Co-Citation Graph
—In spite of numerous search engines available on the web, no single engine is capable of performing “better” under all circumstances. This being the case, metasearch engines...
Hyun-Chul Lee
AAAI
2004
14 years 11 months ago
A General Solution to the Graph History Interaction Problem
Since the state space of most games is a directed graph, many game-playing systems detect repeated positions with a transposition table. This approach can reduce search effort by ...
Akihiro Kishimoto, Martin Müller 0003