Abstract
We present an algorithm for compressing pattern databases (PDBs) and a method for fast random access of these compressed PDBs. We demonstrate the effectiveness of our technique by compressing two 6-tile sliding-tile PDBs by a factor of 12 and a 7-tile sliding-tile PDB by a factor of 24.
Cite
CITATION STYLE
APA
Schreiber, E. L., & Korf, R. E. (2011). Using Partitions and Superstrings for Lossless Compression of Pattern Databases. In Proceedings of the 25th AAAI Conference on Artificial Intelligence, AAAI 2011 (pp. 1814–1815). AAAI Press. https://doi.org/10.1609/aaai.v25i1.8047
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free