Learning heuristics for OBDD minimization by evolutionary algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1141, Issue , 1996, Pages 730-739

  Drechsler, Rolf ^a   Göckel, Nicole ^a   Becker, Bernd ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BINARY DECISION DIAGRAMS; EVOLUTIONARY ALGORITHMS; HEURISTIC METHODS; LEARNING ALGORITHMS;

BASIC OPERATION; ORDERED BINARY DECISION DIAGRAMS; STATE OF THE ART; VARIABLE ORDER;

PROBLEM SOLVING;

EID: 84958959413     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61723-X_1036     Document Type: Conference Paper

References (30)

1. P. Ashar, S. Devadas, and K. Keutzer. Gate-delay-fault testability properties of multiplexor-based networks. In Int’l Test Conf., pages 887-896, 1991.
2. P. Ashar, S. Devadas, and K. Keutzer. Path-delay-fault testability properties of multiplexor-based networks. Integration the VLSI Jour., 15(1):1-23, 1993.
3. T. Bäck and H. Schwefel. An overview of evolutionary algorithms for parameter optimization. Evolutionary Computation, 1(1):1-23, 1993.
4. B. Bollig, M. Löbbing, and I. Wegener. Simulated annealing to improve variable orderings for OBDDs. In Int’l Workshop on Logic Synth., pages 5b:5.1-5.10, 1995.
5. B. Bollig, P. Savicky, and I. Wegener. On the improvement of variable orderings for OBDDs. IFIP Workshop on Logic and Architecture Synthesis, Grenoble, pages 71-80, 1994.
6. R.E. Bryant. Graph - based algorithms for Boolean function manipulation. IEEE Trans. on Comp., 8:677-691, 1986.
7. R.E. Bryant. Symbolic boolean manipulation with ordered binary decision diagrams. ACM, Comp. Surveys, 24:293-318, 1992.
8. L. Davis. Handbook of Genetic Algorithms. van Nostrand Reinhold, New York, 1991.
9. R. Drechsler and B. Becker. Learning heuristics by genetic algorithms. In ASP Design Automation Conf., pages 349-352, 1995.
10. R. Drechsler, B. Becket, and N. GSckel. A genetic algorithm for minimization of Fixed Polarity Reed-Muller expressions. In Int’l Conf. on Artificial Neural Networks and Genetic Algorithms, pages 392-395, 1995.
11. R. Drechsler, B. Becket, and N. Göckel. A genetic algorithm for variable ordering of OBDDs. In Int’l Workshop on Logic Synth., pages P5c:5.55-5.64, 1995.
12. H. Esbensen. A macro-cell global router based on two genetic algorithms. In European Design Automation Conf., pages 428-433, 1994.
13. S.J. Friedman and K.J. Supowit. Finding the optimal variable ordering for binary decision diagrams. In Design Automation Conf., pages 348-356, 1987.
14. H. Fujii, G. Ootomo, and C. Hori. Interleaving based variable ordering methods for ordered binary decision diagrams. In Int’l Conf. on CAD, pages 38-41, 1993.
15. M. Fujita, H. Fujisawa, and N. Kawato. Evaluation and improvements of boolean comparison method based on binary decision diagrams. In Int’l Conf. on CAD, pages 2-5, 1988.
16. M. Fkljita, H. Fujisawa, and Y. Matsunaga. Variable ordering algorithms for binary decision diagrams and their evolution. IEEE Trans. on CAD, 12:6-12, 1993.
17. M. Fujita, Y. Matsunga, and T. Kakuda. On variable ordering of binary decision diagrams for the application of multi-level synthesis. In European Conf. on Design Automation, pages 50-54, 1991.
18. D.E. Goldberg. Genetic Algortithms in Search, Optimization & Machine Learning. Addision-Wesley Publisher Company, Inc., 1989.
19. N. Ishiura, H. Sawada, and S. Yajima. Minimization of binary decision diagrams based on exchange of variables. In Int’l Conf. on CAD, pages 472-475, 1991.
20. A. Kuehlmann and L.P.P.P. van Ginneken. Grammar-based optimization of synthesis scenarios. In Int’l Conf. on Comp. Design, pages 20-25, 1994.
21. L. Lavagno, P. McGeer, A. Saldanha, and A.L. Sangiovanni-Vincentelli. Timed shannon circuits: A power-efficient design style and synthesis tool. In Design Automation Conf., pages 254-260, 1995.
22. V.V. Le, T. Besson, A. Abbara, D. Brasen, H. Bogushevitsh, G. Saucier, and M. Crastes. ASIC prototyping with area oriented mapping for ALTERA/FLEX devices. In SASIMI, pages 176-183, 1995.
23. J. Lienig and K. Thulasiraman. A genetic algorithm for channel routing in VLSI circuits. Evolutionary Computation, 1(4):293-311, 1993.
24. S. Malik, A.R. Wang, R.K. Brayton, and A.L. Sangiovanni-Vincentelli. Logic verification using binary decision diagrams in a logic synthesis environment. In Int’l Conf. on CAD, pages 6-9, 1988.
25. S. Minato, N. Ishiura, and S. Yajima. Shared binary decision diagrams with attributed edges for efficient boolean function manipulation. In Design Automation Conf., pages 52-57, 1990.
26. R. Murgai, Y. Nishizaki, N. Shenoy, R.K. Brayton, and A. Sangiovanni- Vincentelli. Logic synthesis for programmable gate arrays. In Design Automation Conf., pages 620-625, 1990.
27. S. Panda and F. Somenzi. Who are the variables in your neighborhood. In Int’l Conf. on CAD, pages 74-77, 1995.
28. D.E. Ross, K.M. Butler, R. Kaput, and M.R. Mercer. Functional approaches to generating orderings for efficient symbolic representations. In Design Automation Conf., pages 624-627, 1992.
29. R. Rudell. Dynamic variable ordering for ordered binary decision diagrams. In Int’l Conf. on CAD, pages 42-47, 1993.
30. S. Yang. Logic synthesis and and optimization benchmarks user guide. Technical Report 1/95, Microelectronic Center of North Carolina, Jan. 1991.