1434 search results - page 52 / 287 » Graph Searching with Advice |
GECCO
2009
Springer
14 years 3 months ago
2009
Springer
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
ECEASST
2006
13 years 8 months ago
2006
Mining for frequent subgraphs in a graph database has become a popular topic in the last years. Algorithms to solve this problem are used in chemoinformatics to find common molecul...
AIPS
2000
13 years 10 months ago
2000
Themostefficient planning algorithms recently developed are mainly based on Graphplansystem or on satisfiability approach. In this paper wepresent a new approach to plan generatio...
AAAI
1990
13 years 10 months ago
1990
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...
ESA
2009
Springer
14 years 3 months ago
2009
Springer
Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with s...