An Adaptive GP Strategy for Evolving Digital Circuits

  • Mihai Oltean
  • Laura Dioşan
Conference paper

DOI: 10.1007/978-3-540-85567-5_47

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5179)
Cite this paper as:
Oltean M., Dioşan L. (2008) An Adaptive GP Strategy for Evolving Digital Circuits. In: Lovrek I., Howlett R.J., Jain L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2008. Lecture Notes in Computer Science, vol 5179. Springer, Berlin, Heidelberg

Abstract

The aim of this research is to develop an adaptive system for designing digital circuits. The investigated system, called Adaptive Genetic Programming (AdGP) contains most of the features required by an adaptive GP algorithm: it can decide the chromosome depth, the population size and the nodes of the GP tree which are the best suitable to provide the desired outputs. We have tested AdGP algorithm by solving some well-known problems in the field of digital circuits. Numerical experiments show that AdGP is able to perform very well on the considered test problems being able to successfully compete with standard GP having manually set parameters.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Mihai Oltean
    • 1
  • Laura Dioşan
    • 1
    • 2
  1. 1.Department of Computer Science, Faculty of Mathematics and Computer ScienceBabeş-Bolyai UniversityCluj-NapocaRomania
  2. 2.Laboratoire d’Informatique, de Traitement de l’Information et des Systèmes, EA 4108 Institut National des Sciences Appliquées RouenFrance

Personalised recommendations