A heuristic search algorithm with modifiable estimate
Artificial Intelligence
Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Criticizing solutions to relaxed models yields powerful admissible heuristics
Information Sciences: an International Journal
Sorting with fixed-length reversals
Discrete Applied Mathematics - Special volume on computational molecular biology
I/O-complexity of graph algorithms
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Disjoint pattern database heuristics
Artificial Intelligence - Chips challenging champions: games, computers and Artificial Intelligence
Ranking and unranking permutations in linear time
Information Processing Letters
Improved probabilistic verification by hash compaction
CHARME '95 Proceedings of the IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Memory-efficient A* heuristics for multiple sequence alignment
Eighteenth national conference on Artificial intelligence
Journal of the ACM (JACM)
Breadth-first heuristic search
Artificial Intelligence
Maximizing over multiple pattern databases speeds up heuristic search
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
Dual search in permutation state spaces
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
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Additive pattern database heuristics
Journal of Artificial Intelligence Research
An improved search algorithm for optimal multiple-sequence alignment
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
Delayed duplicate detection: extended abstract
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Dual lookups in pattern databases
IJCAI'05 Proceedings of the 19th international joint conference on Artificial 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
Solving the 24 puzzle with instance dependent pattern databases
SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
Partial Symbolic Pattern Databases for Optimal Sequential Planning
KI '08 Proceedings of the 31st annual German conference on Advances in Artificial Intelligence
Linear-time disk-based implicit graph search
Journal of the ACM (JACM)
Compressing Pattern Databases with Learning
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Multi-valued Pattern Databases
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Minimizing disk I/O in two-bit breadth-first search
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Learning from multiple heuristics
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Predicting the performance of IDA* with conditional distributions
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Memory-based heuristics for explicit state spaces
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Predicting the performance of IDA* using conditional distributions
Journal of Artificial Intelligence Research
Inconsistent heuristics in theory and practice
Artificial Intelligence
Hi-index | 0.00 |
A pattern database (PDB) is a heuristic function implemented as a lookup table that stores the lengths of optimal solutions for subproblem instances. Standard PDBs have a distinct entry in the table for each subproblem instance. In this paper we investigate compressing PDBs by merging several entries into one, thereby allowing the use of PDBs that exceed available memory in their uncompressed form. We introduce a number of methods for determining which entries to merge and discuss their relative merits. These vary from domain-independent approaches that allow any set of entries in the PDB to be merged, to more intelligent methods that take into account the structure of the problem. The choice of the best compression method is based on domain-dependent attributes. We present experimental results on a number of combinatorial problems, including the four-peg Towers of Hanoi problem, the sliding-tile puzzles, and the Top-Spin puzzle. For the Towers of Hanoi, we show that the search time can be reduced by up to three orders of magnitude by using compressed PDBs compared to uncompressed PDBs of the same size. More modest improvements were observed for the other domains.