Sciweavers

96 search results - page 9 / 20
» Homologous Crossover in Genetic Programming
Sort
View
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
14 years 7 days ago
Dormant program nodes and the efficiency of genetic programming
In genetic programming, there is a tendency for individuals in a population to accumulate fragments of code – often called introns – which are redundant in the fitness evaluat...
David Jackson
GECCO
2009
Springer
103views Optimization» more  GECCO 2009»
14 years 1 months ago
Why evolution is not a good paradigm for program induction: a critique of genetic programming
We revisit the roots of Genetic Programming (i.e. Natural Evolution), and conclude that the mechanisms of the process of evolution (i.e. selection, inheritance and variation) are ...
John R. Woodward, Ruibin Bai
GECCO
2009
Springer
166views Optimization» more  GECCO 2009»
14 years 1 months ago
Genetic programming in the wild: evolving unrestricted bytecode
We describe a methodology for evolving Java bytecode, enabling the evolution of extant, unrestricted Java programs, or programs in other languages that compile to Java bytecode. B...
Michael Orlov, Moshe Sipper
GECCO
2007
Springer
200views Optimization» more  GECCO 2007»
14 years 26 days ago
Adaptive genetic programming for option pricing
Genetic Programming (GP) is an automated computational programming methodology, inspired by the workings of natural evolution techniques. It has been applied to solve complex prob...
Zheng Yin, Anthony Brabazon, Conall O'Sullivan
GECCO
2011
Springer
248views Optimization» more  GECCO 2011»
12 years 10 months ago
Size-based tournaments for node selection
In genetic programming, the reproductive operators of crossover and mutation both require the selection of nodes from the reproducing individuals. Both unbiased random selection a...
Thomas Helmuth, Lee Spector, Brian Martin