Compressing Binary Decision Diagrams

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

The paper introduces a new technique for compressing Binary Decision Diagrams in those cases where random access is not required. Using this technique, compression and decompression can be done in linear time in the size of the BDD and compression will in many cases reduce the size of the BDD to 1-2 bits per node. Empirical results for our compression technique are presented, including comparisons with previously introduced techniques, showing that the new technique dominate on all tested instances.
Full (tech-report) version of ECAI 2008 short paper

Keywords

Artificial Intelligence, Distributed, Parallel, and Cluster Computing

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/212652

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0805.3267
 http://arxiv.org/abs/0805.3267

Collections

arXiv