BDD minimization by scatter search

Authors:
W. N.N. Hung;Xiaoyu Song;E. M. Aboulhamid;M. A. Driscoll
Affiliations:
Intel Archit. Group, Intel Corp., Hillsboro, OR;-;-;-
Venue:
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Year:
2006

Citing 0
Cited 6

Towards the Exact Minimization of BDDs—An Elitism-Based Distributed Evolutionary Algorithm

Journal of Heuristics
Quantum logic synthesis by symbolic reachability analysis

Proceedings of the 41st annual Design Automation Conference
A hybrid scatter search for the probabilistic traveling salesman problem

Computers and Operations Research
Routability checking for three-dimensional architectures

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Detecting credit card fraud by genetic algorithm and scatter search

Expert Systems with Applications: An International Journal
Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries

Computers and Operations Research

Quantified Score

Hi-index	0.04

Visualization

Abstract

Reduced-ordered binary decision diagrams (BDDs) are a data structure for representation and manipulation of Boolean functions. The variable ordering largely influences the size of the BDD, varying from linear to exponential. In this paper, the authors study the BDD minimization problem based on scatter search optimization. Scatter search offers a reasonable compromise between quality (BDD reduction) and time. On smaller benchmarks it delivers almost optimal BDD size with less time than the exact algorithm. For larger benchmarks it delivers smaller BDD sizes than genetic algorithm or simulated annealing at the expense of longer runtime.