118 search results - page 15 / 24 » Fitness Clouds and Problem Hardness in Genetic Programming |
TSMC
2008
13 years 7 months ago
2008
In genetic programming (GP), evolving tree nodes separately would reduce the huge solution space. However, tree nodes are highly interdependent with respect to their fitness. In th...
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
We present a new method of Logic-Based Genetic Programming (LBGP). Using the intrinsic mechanism of backtracking in Prolog, we utilize large individual programs with redundant clau...
EUROGP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Cartesian Genetic Programming is a graph based representation that has many benefits over traditional tree based methods, including bloat free evolution and faster evolu...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
Based in part on observations about the incremental nature of most state changes in biological systems, we introduce the idea of Memory with Memory in Genetic Programming (GP), wh...
EUROGP
1999
Springer
13 years 12 months ago
1999
Springer
Genetic programming is known to be capable of creating designs that satisfy prespecified high-level design requirements for analog electrical circuits and other complex structures...