Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
The (n2-1)-puzzle and related relocation problems
Journal of Symbolic Computation
Shared binary decision diagram with attributed edges for efficient Boolean function manipulation
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Computer-aided verification of coordinating processes: the automata-theoretic approach
Computer-aided verification of coordinating processes: the automata-theoretic approach
I/O-complexity of graph algorithms
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Symbolic Model Checking
SetA*: an efficient BDD-based heuristic search algorithm
Eighteenth national conference on Artificial intelligence
Directed explicit-state model checking in the validation of communication protocols
International Journal on Software Tools for Technology Transfer (STTT)
Solving Rubik's Cube: disk is the new RAM
Communications of the ACM - The psychology of security: why do good users make bad decisions?
Partial Symbolic Pattern Databases for Optimal Sequential Planning
KI '08 Proceedings of the 31st annual German conference on Advances in Artificial Intelligence
External-memory pattern databases using structured duplicate detection
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Limits and possibilities of BDDs in state space search
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Additive pattern database heuristics
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
Breadth-first heuristic search
Artificial Intelligence
SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
Combining perimeter search and pattern database abstractions
SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
Finding optimal solutions to Rubik's cube using pattern databases
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of 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
Learning heuristic functions for large state spaces
Artificial Intelligence
| Hi-index | 0.00 |
In this paper, we illustrate efforts to perform memory efficient large-scale search. We first generate sets of disjoint symbolic pattern databases on disk. These pattern databases are then used for heuristic guidance, while applying explicit-state external-memory heuristic search. Different options for parallelization to save time and memory are presented. The general techniques are mapped to the (n 2 *** 1)-puzzle as a large-scale case study.