Abstract
Among many other applications, evolutionary methods have been used to develop heuristics for several optimization problems in VLSI CAD in recent years. Although learning is performed according to a set of training benchmarks, it is most important to generate heuristics that have a good generalization behaviour and hence are well suited to be applied to unkown examples. Besides large runtimes for learning, the major drawback of these approaches is that they are very sensitive to a variety of parameters for the learning process.
In this paper, we study the impact of different parameters, like e.g. stopping conditions, on the quality of the results for learning heuristics for BDD minimization. If learning takes too long, the developed heuristics become too specific for the set of training, examples and in that case results of application to unknown problem instances deteriorate. It will be demonstrated here that runtime can be saved while even improving the generalization behaviour of the heuristics.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
B. Bollig and I. Wegener. Improving the variable ordering of OBDDs in NP-complete. IEEE Trans. on Comp., 45(9):993–1002, 1996.
R.E. Bryant. Graph — based algorithms for Boolean function manipulation. IEEE Trans. on Comp., 35(8):677–691, 1986.
L. Davis. Handbook of Genetic Algorithms. van Nostrand Reinhold, New York, 1991.
N. Drechsler, F. Schmiedle, D. Große, and R. Drechsler. Heuristic learning based on genetic programming. In EuroGP, volume 2039 of LNCS, pages 1–10. Springer Verlag, 2001.
R. Drechsler. Evolutionary Algorithms for VLSI CAD. Kluwer Academic Publishers, 1998.
R. Drechsler and B. Becker. Learning heuristics by genetic algorithms. In ASP Design Automation Conf., pages 349–352, 1995.
R. Drechsler, B. Becker, and N. Göckel. Minimization of OKFDDs by genetic algorithms. In Int'l Symposium on Soft Computing, pages B:271–B:277, 1996.
M. Fujita, Y. Matsunaga, 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.
D.E. Goldberg. Genetic Algorithms in Search, Optimization & Machine Learning. Addison-Wesley Publisher Company, Inc., 1989.
J. Koza. Genetic Programming — On the Programming of Computers by means of Natural Selection. MIT Press, 1992.
Z. Michalewicz. Genetic Algorithms + Data Structures = Evolution Programs. Springer-Verlag, 1994.
S. Panda and F. Somenzi. Who are the variables in your neighborhood. In Int'l Conf. on CAD, pages 74–77, 1995.
R. Rudell. Dynamic variable ordering for ordered binary decision diagrams. In Int'l Conf. on CAD, pages 42–47, 1993.
F. Schmiedle, N. Drechsler, D. Große, and R. Drechsler. Priorities in multi-objective optimization for genetic programming. In Genetic and Evolutionary Computation Conference, 2001.
S. Yang. Logic synthesis and optimization benchmarks user guide. Technical Report 1/95, Microelectronic Center for North Carolina, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schmiedle, F., Große, D., Drechsler, R., Becker, B. (2001). Too Much Knowledge Hurts: Acceleration of Genetic Programs for Learning Heuristics. In: Reusch, B. (eds) Computational Intelligence. Theory and Applications. Fuzzy Days 2001. Lecture Notes in Computer Science, vol 2206. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45493-4_49
Download citation
DOI: https://doi.org/10.1007/3-540-45493-4_49
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42732-2
Online ISBN: 978-3-540-45493-9
eBook Packages: Springer Book Archive