BDD minimization by scatter search

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 21, Issue 8, 2002, Pages 974-979

  Hung, William N N ^a   Song, Xiaoyu ^b   Aboulhamid, El Mostapha ^c   Driscoll, Michael A ^b  

^a INTEL CORPORATION   (United States)

^b Portland State University   (United States)

^c UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

BDDs; Optimization; Scatter search

Indexed keywords

ALGORITHMS; DATA STRUCTURES; DECISION THEORY; SIMULATED ANNEALING;

BINARY DECISION DIAGRAMS (BDD);

BOOLEAN FUNCTIONS;

EID: 0036684718     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCAD.2002.800452     Document Type: Article

References (22)

1. Scatter search
2. A template for scatter search and path relinking
3. Heuristic minimization of BDD's using don't cares
4. Exact minimization of binary decision diagrams using implicit techniques
5. Heuristic symmetry reduction for invariant verification
6. Graph-based algorithms for boolean function manipula-tion
7. On variable ordering of binary decision diagrams for the application of multi-level synthesis
8. Advanced ordering and manipulation techniques for binary decision diagrams
9. Variable ordering algorithms for ordered binary decision diagrams and their evaluation
10. Dynamic variable ordering for ordered binary decision diagrams
11. Finding the optimal variable ordering for binary decision diagrams
12. An efficient method for optimal BDD ordering computation
13. A genetic algorithm for variable ordering of OBDD's
14. Simulated annealing to improve variable orderings for OBDD's
15. Improving the variable ordering of OBDD's is NP-complete
16. Fast exact minimization of BDD's
17. Using lower bounds during dynamic BDD minimization
18. BDD minimization using symmetries
19. Dynamic variable reordering for BDD minimization