Sciweavers

1162 search results - page 1 / 233
» Cartesian genetic programming
Sort
View
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
13 years 8 months ago
A new crossover technique for Cartesian genetic programming
Genetic Programming was first introduced by Koza using tree representation together with a crossover technique in which random sub-branches of the parents' trees are swapped ...
Janet Clegg, James Alfred Walker, Julian Francis M...
EUROGP
2004
Springer
135views Optimization» more  EUROGP 2004»
13 years 10 months ago
Reusing Code in Genetic Programming
Abstract. In this paper we propose an approach to Genetic Programming based on code reuse and we test it in the design of combinational logic circuits at the gate-level. The circui...
Edgar Galván López, Riccardo Poli, C...
EUROGP
2008
Springer
137views Optimization» more  EUROGP 2008»
13 years 6 months ago
A Comparison of Cartesian Genetic Programming and Linear Genetic Programming
Two prominent genetic programming approaches are the graph-based Cartesian Genetic Programming (CGP) and Linear Genetic Programming (LGP). Recently, a formal algorithm for construc...
Garnett Carl Wilson, Wolfgang Banzhaf
GECCO
2009
Springer
142views Optimization» more  GECCO 2009»
13 years 9 months ago
Evolution, development and learning using self-modifying cartesian genetic programming
Self-Modifying Cartesian Genetic Programming (SMCGP) is a form of genetic programming that integrates developmental (self-modifying) features as a genotype-phenotype mapping. This...
Simon Harding, Julian Francis Miller, Wolfgang Ban...
GECCO
2005
Springer
127views Optimization» more  GECCO 2005»
13 years 10 months ago
Investigating the performance of module acquisition in cartesian genetic programming
Embedded Cartesian Genetic Programming (ECGP) is a form of the graph based Cartesian Genetic Programming (CGP) in which modules are automatically acquired and evolved. In this pap...
James Alfred Walker, Julian Francis Miller