Heuristic learning based on genetic programming

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

Volumn 2038, Issue , 2001, Pages 1-10

  Drechsler, Nicole ^a   Schmiedle, Frank ^a   Gro e, Daniel ^a   Drechsler, Rolf ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY DECISION DIAGRAMS; GENETIC ALGORITHMS; HEURISTIC PROGRAMMING;

BINARY DECISION DIAGRAMS (BDDS); EVOLUTIONARY METHOD; EVOLUTIONARY TECHNIQUES; HEURISTIC LEARNING; HIGH QUALITY; LARGE PROBLEMS; LEARNING PHASE; PROBLEM INSTANCES;

GENETIC PROGRAMMING;

EID: 0037908000     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45355-5_1     Document Type: Conference Paper

References (14)

1. R.E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Trans. on Comp., 8:677-691, 1986.
2. B. Bollig and I. Wegener. Improving the variable ordering of OBDDs is NP-complete. IEEE Trans. on Comp., vol. 45, num. 9, pages 993-1002, 1996.
3. 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.
4. R. Drechsler and B. Becker. Learning heuristics by genetic algorithms. In ASP Design Automation Conf., pages 349-352, 1995.
5. R. Drechsler and B. Becker. Binary Decision Diagrams -- Theory and Implementation, Kluwer Academic Publishers, 1998
6. R. Drechsler, B. Becker, 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.
7. N. Drechsler, R. Drechsler, and B. Becker. A new model for multi-objective optimization in evolutionary algorithms. In Fuzzy’99, LNCS 1625, pages 108-117, 1999.
8. R. Drechsler, N. G ckel, and B. Becker. Learning heuristics for OBDD minimization by evolutionary algorithms. In PPSN’96, LNCS 1141, pages 730-739, 1996.
9. 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.
10. J. Koza. Genetic Programming - On the Programming of Computers by means of Natural Selection. MIT Press, 1992
11. J. Koza. Genetic Programming II Automatic Discovery of Reusable Programs. MIT Press, 1994
12. S. Panda and F. Somenzi. Who are the variables in your neighborhood. In Int’l Conf. on CAD, pages 74-77, 1995.
13. D.E. Ross, K.M. Butler, R. Kapur, and M.R. Mercer. Functional approaches to generating orderings for efficient symbolic representations. In Design Automation Conf., pages 624-627, 1992.
14. R. Rudell. Dynamic variable ordering for ordered binary d ecision diagrams. In Int’l Conf. on CAD, pages 42-47, 1993.