Vol. 3 No. 1 (2010): Third Annual Symposium on Combinatorial Search
Oral Presentations
Adaptive K-Parallel Best-First Search: A Simple but Efficient Algorithm for Multi-Core Domain-Independent Planning
PDFFinding Acceptable Solutions Faster Using Inadmissible Information
PDFDirected Plateau Search for MAX-k-SAT
PDFSearching for a k-Clique in Unknown Graphs
PDFImproving Local Search for Resource-Constrained Planning
PDFAdding Diversity to Classical Heuristic Planning
PDFOn the Scaling Behavior of HDA*
PDFObjective Functions for Multi-Way Number Partitioning
PDFLayer-Abstraction for Symbolically Solving General Two-Player Games
PDFOn Transposition Tables for Single-Agent Search and Planning: Summary of Results
PDFBootstrap Learning of Heuristic Functions
PDFCommon Misconceptions Concerning Heuristic Search
PDFPortal-Based True-Distance Heuristics for Path Finding
PDFHeuristic Contraction Hierarchies with Approximation Guarantee
PDFGPU Exploration of Two-Player Games with Perfect Hash Functions
PDFReal-Time Search in Dynamic Worlds
PDFAdditive Heuristic for Four-Connected Gridworlds
PDF
Frontmatter
Posters
Landmark Heuristics for the Pancake Problem
PDFComputing Equivalent Transformations for Combinatorial Optimization by Branch-and-Bound Search
PDFPotential Search: A New Greedy Anytime Heuristic Search
PDFAnytime Heuristic Search: Frameworks and Algorithms
PDFA Comparison of Greedy Search Algorithms
PDFEdge Partitioning in Parallel Structured Duplicate Detection
PDF
Position Papers
Abstracts from Other Conference Papers
Search Space Reduction Using Swamp Hierarchies
PDFSimultaneously Searching with Multiple Settings: An Alternative to Parameter Tuning for Suboptimal Single-Agent Search Algorithms
PDFSearch-Based Path Planning with Homotopy Class Constraints
PDFHigh-Quality Policies for the Canadian Traveler’s Problem
PDFEvolving Hyper Heuristic-Based Solvers for Rush Hour and FreeCell
PDFSingle-Frontier Bidirectional Search
PDFLazy Theta*: Any-Angle Path Planning and Path Length Analysis in 3D
PDF