Using Partitions and Superstrings for Lossless Compression of Pattern Databases

AAAI 2011 pp. 1814-1815

doi:10.1609/AAAI.V25I1.8047 /aaai/2011/schreiber2011aaai-using/

Abstract

We present an algorithm for compressing pattern databases (PDBs) and a method for fast random access of these com-pressed 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.

PDF AAAI Semantic Scholar

Cite

Text

Schreiber and Korf. "Using Partitions and Superstrings for Lossless Compression of Pattern Databases." AAAI Conference on Artificial Intelligence, 2011. doi:10.1609/AAAI.V25I1.8047

Markdown

[Schreiber and Korf. "Using Partitions and Superstrings for Lossless Compression of Pattern Databases." AAAI Conference on Artificial Intelligence, 2011.](https://mlanthology.org/aaai/2011/schreiber2011aaai-using/) doi:10.1609/AAAI.V25I1.8047

BibTeX

@inproceedings{schreiber2011aaai-using,
  title     = {{Using Partitions and Superstrings for Lossless Compression of Pattern Databases}},
  author    = {Schreiber, Ethan L. and Korf, Richard E.},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2011},
  pages     = {1814-1815},
  doi       = {10.1609/AAAI.V25I1.8047},
  url       = {https://mlanthology.org/aaai/2011/schreiber2011aaai-using/}
}