Amortized efficiency of list update and paging rules
Communications of the ACM
Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
I/O-complexity of graph algorithms
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Disjoint pattern database heuristics
Artificial Intelligence - Chips challenging champions: games, computers and Artificial Intelligence
External-Memory Breadth-First Search with Sublinear I/O
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Memory-efficient A* heuristics for multiple sequence alignment
Eighteenth national conference on Artificial intelligence
Sweep A*: Space-Efficient Heuristic Search in Partially Ordered Graphs
ICTAI '03 Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Best-first frontier search with delayed duplicate detection
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Space-efficient memory-based heuristics
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Structured duplicate detection in external-memory graph search
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
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
Breadth-first heuristic search
Artificial Intelligence
Automated Creation of Pattern Database Search Heuristics
Model Checking and Artificial Intelligence
Real-Time Model Checking on Secondary Storage
Model Checking and Artificial Intelligence
Linear-time disk-based implicit graph search
Journal of the ACM (JACM)
Scaling Search with Pattern Databases
Model Checking and Artificial Intelligence
Domain-independent structured duplicate detection
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Memory intensive AND/OR search for combinatorial optimization in graphical models
Artificial Intelligence
Parallel structured duplicate detection
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
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
SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
Leveraging graph locality via abstraction
SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
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 |
A pattern database is a lookup table that stores an exact evaluation function for a relaxed search problem, which provides an admissible heuristic for the original search problem. In general, the larger the pattern database, the more accurate the heuristic function. We consider how to build large pattern databases that are stored in external memory, such as disk, and how to use an external-memory pattern database efficiently in heuristic search. To limit the number of slow disk I/O operations needed to construct and query an external-memory pattern data-base, we adapt an approach to external-memory graph search called structured duplicate detection that localizes memory references by leveraging an abstraction of the state space. We present results that show this approach increases the scalability of heuristic search by allowing larger and more accurate pattern database heuristics.