Revision of the existing techniques in genetic programming to evolve the subroutines
DOI:
https://doi.org/10.15381/risi.v10i1.5715Keywords:
Genetic algorithm, evolution of subroutines, genetic programmingAbstract
The genetic programming (GP) is a machine learning technique based on !he evolution of computer programs by a genetic algorithm. The version, called ADF (automatic function definition) to reuse a subroutine several times within the same individual. However, there is the possibility that the same subroutine may be reused by several individuals from the same population. There are several sys tems that, in principie, allow subroutines discover valid for many individuals in a population. One of the most advanced is the DLGP dynamic network. This work aims to develop the State of Art of PG varied techniques lo evolve existing subroutinesDownloads
Downloads
Published
Issue
Section
License
Copyright (c) 2013 Ana Maria Huayna Dueñas
![Creative Commons License](http://i.creativecommons.org/l/by-nc-sa/4.0/88x31.png)
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
AUTHORS RETAIN THEIR RIGHTS:
a. Authors retain their trade mark rights and patent, and also on any process or procedure described in the article.
b. Authors retain their right to share, copy, distribute, perform and publicly communicate their article (eg, to place their article in an institutional repository or publish it in a book), with an acknowledgment of its initial publication in the Revista de investigación de Sistemas e Informática.
c. Authors retain theirs right to make a subsequent publication of their work, to use the article or any part thereof (eg a compilation of his papers, lecture notes, thesis, or a book), always indicating its initial publication in the Revista de investigación de Sistemas e Informática (the originator of the work, journal, volume, number and date).