R. Aler, F. Blázquez and D. Camacho
Una versión avanzada de la PG, denominada ADF (definición automática de funciones), intenta aprovechar las regularidades de los dominios a resolver aprendiendo simultáneamente subrutinas que codifiquen dichas regularidades. Dicha versión, permite reutilizar una subrutina varias veces dentro de un mismo individuo. Sin embargo, existe la posibilidad de que la misma subrutina pueda ser reaprovechada por varios individuos de la misma población.
J.R. Koza
The new "genetic programming" paradigm described herein provides a way to search for this most fit individual computer program. In this paper, the process of formulating and solving problems using this new paradigm is illustrated using examples from various areas.
J.R. Koza
The report demonstrates that a hierarchical architecture can be evolved to solve an illustrative symbolic regression problem using the architecture-altering operations.
Robert Keller and Wolfgang Banzhaf
Facts and theories from molecular biology suggest the introduction of non-identical genospaces and phenospaces, and a generic genotype-phenotype mapping (GPM) which maps unconstrained genotypes into syntactically correct phenotypes.We propose a concrete GPM which maps linear binary genotypes into linear phenotypes of an arbitrary LALR programming language.
David Andre
This report describes the parallel implementation of genetic programming in the C programming language using a PC 486 type computer (running Windows) acting as a host and a network of transputers acting as processing nodes.
J. Niehaus and W. Banzhaf
In this work we tried to reduce the number of free parameters within Genetic Programming without reducing the quality of the results. We developed three new methods to adapt the probabilities, different genetic operators are applied with. Using two problems from the areas of symbolic regression and classification we showed that the results in these cases were better than randomly chosen parameter sets and could compete with parameter sets chosen with empirical knowledge.
J. R. Koza, W. Mydlowec, G. Lanza, J. Yu and M. A. Keane
This paper describes how genetic programming automatically created a metabolic pathway involving four chemical reactions that takes in glycerol and fatty acid as input, uses ATP as a cofactor, and produces diacyl-glycerol as its final product.
E. Alba, J.F. Aldana and J.M. Troya
A genetic programming approach to fuzzy logic controller (FLC) design is presented in this paper. We propose an encoding that represents fuzzy rule-bases as type-constrained syntactic trees implemented as variable-length strings. This encoding is applied to the cart centering problem and compared with other approaches: an intuitive FLC done by hand, an FLC obtained by a traditional genetic algorithm operating on fixed length strings and the analytical optimal solution (bang-bang rule).
Libraries
J. J. Merelo, A. Prieto and Grupo GeNeura
In this paper, we will try to show what does EC have to do with object-oriented programming in section 2; then why it has some advantage if it is written in C ++ , and why the framework proposed, GAGS, has got many of the features desirable in an evolutionary computation library , in section 3.
Marc Schoenaeuer and J. J. Merelo
Transparences about Procedural/ object oriented programming, What is OOP and C++ , OO-Genetic Algorithms (and EC) and GAGS
Enrique Alba Torres
This packet is composed of a Modula-2 easy and simple definition of a steady-state genetic algorithm in the form of abstract data type. Also versions for a distributed GA and a cellular GA are included.