Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
A classical mind
Database System Implementation
Database System Implementation
A Divide and Conquer Bidirectional Search: First Results
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Divide-and-Conquer Frontier Search Applied to Optimal Sequence Alignment
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Using Magnatic Disk Instead of Main Memory in the Murphi Verifier
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Delayed duplicate detection: extended abstract
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Journal of the ACM (JACM)
Information Processing Letters
Breadth-first heuristic search
Artificial Intelligence
Maximizing over multiple pattern databases speeds up heuristic search
Artificial Intelligence
A comparative analysis of parallel disk-based Methods for enumerating implicit graphs
Proceedings of the 2007 international workshop on Parallel symbolic computation
Dynamic Delayed Duplicate Detection for External Memory Model Checking
SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
Linear-time disk-based implicit graph search
Journal of the ACM (JACM)
Harnessing parallel disks to solve Rubik's cube
Journal of Symbolic Computation
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Sequential and parallel algorithms for frontier A* with delayed duplicate detection
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Domain-independent structured duplicate detection
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Large-scale parallel breadth-first search
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
External-memory pattern databases using structured duplicate detection
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Best-first search for treewidth
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Additive pattern database heuristics
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
Recent progress in heuristic search: a case study of the four-peg towers of Hanoi problem
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Edge partitioning in external-memory graph search
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Breadth-first heuristic search
Artificial Intelligence
Information Processing Letters
I/O efficient accepting cycle detection
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Revisiting resistance speeds up I/O-efficient LTL model checking
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Flash memory efficient LTL model checking
Science of Computer Programming
A survey and classification of A* based best-first heuristic search algorithms
SBIA'10 Proceedings of the 20th Brazilian conference on Advances in artificial intelligence
External memory breadth-first search with delayed duplicate detection on the GPU
MoChArt'10 Proceedings of the 6th international conference on Model checking and artificial intelligence
I/O efficient directed model checking
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Parallel external directed model checking with linear i/o
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Large-Scale directed model checking LTL
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
Evaluation of a simple, scalable, parallel best-first search strategy
Artificial Intelligence
Dynamic state space partitioning for external memory state space exploration
Science of Computer Programming
Minimizing writes in parallel external memory search
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
Best-first search is limited by the memory needed to store the Open and Closed lists, primarily to detect duplicate nodes. Magnetic disks provide vastly more storage, but random access of a disk is extremely slow. Instead of checking generated nodes immediately against existing nodes in a hash table, delayed duplicate detection (DDD) appends them to a file, then periodically removes the duplicate nodes using only sequential disk accesses. Frontier search saves storage in a best-first search by storing only the Open list and not the Closed list. The main contributions of this paper are to provide a scalable implementation of DDD, to combine it with frontier search, and to extend it to more general best-first searches such as A*. We illustrate these ideas by performing complete breadth-first searches of sliding-tile puzzles up to the 3×5 Fourteen Puzzle. For the 4-peg Towers of Hanoi problem, we perform complete searches with up to 20 disks, searching a space of over a trillion nodes, and discover a surprising anomaly concerning the problem-space diameter of the 15 and 20-disk problems. We also verify the presumed optimal solution lengths for up to 24 disks. In addition, we implement A* with DDD on the Fifteen Puzzle. Finally, we present a scalable implementation of DDD based on hashing rather than sorting.