Sciweavers

1402 search results - page 37 / 281
» Sparse-Memory Graph Search
Sort
View
KR
2004
Springer
15 years 3 months ago
Planning Graphs and Knowledge Compilation
One of the major advances in classical planning has been the development of Graphplan. Graphplan builds a layered structure called the planning graph, and then searches this struc...
Hector Geffner
AAAI
2007
15 years 4 days ago
Parallel Structured Duplicate Detection
We describe a novel approach to parallelizing graph search using structured duplicate detection. Structured duplicate detection was originally developed as an approach to external...
Rong Zhou, Eric A. Hansen
EVOW
2007
Springer
15 years 4 months ago
Iterated k-Opt Local Search for the Maximum Clique Problem
Abstract. This paper presents a simple iterated local search metaheuristic incorporating a k-opt local search (KLS), called Iterated KLS (IKLS for short), for solving the maximum c...
Kengo Katayama, Masashi Sadamatsu, Hiroyuki Narihi...
COMBINATORICS
1998
79views more  COMBINATORICS 1998»
14 years 9 months ago
A Note on Constructing Large Cayley Graphs of Given Degree and Diameter by Voltage Assignments
Voltage graphs are a powerful tool for constructing large graphs (called lifts) with prescribed properties as covering spaces of small base graphs. This makes them suitable for ap...
Ljiljana Brankovic, Mirka Miller, Ján Plesn...
TVCG
2012
184views Hardware» more  TVCG 2012»
13 years 7 days ago
Output-Sensitive Construction of Reeb Graphs
—The Reeb graph of a scalar function represents the evolution of the topology of its level sets. This paper describes a near-optimal output-sensitive algorithm for computing the ...
Harish Doraiswamy, Vijay Natarajan