Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
An Adaptive GP Strategy for Evolving Digital Circuits
| |
|
An Adaptive GP Strategy for Evolving Digital Circuits
Mihai Oltean1 and Laura Dioşan1, 2 
| (1) |
Department of Computer Science, Faculty of Mathematics and Computer Science, Babeş-Bolyai University, Cluj-Napoca, Romania |
| (2) |
Laboratoire d’Informatique, de Traitement de l’Information et des Systèmes, EA 4108 Institut National des Sciences Appliquées, , Rouen, France |
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.
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|