Sciweavers

94 search results - page 14 / 19
» Genetic algorithms with multi-parent recombination
Sort
View
GECCO
2010
Springer
129views Optimization» more  GECCO 2010»
15 years 10 months ago
A probabilistic functional crossover operator for genetic programming
The original mechanism by which evolutionary algorithms were to solve problems was to allow for the gradual discovery of sub-solutions to sub-problems, and the automated combinati...
Josh C. Bongard
RECOMB
2008
Springer
16 years 6 months ago
A Phylogenetic Approach to Genetic Map Refinement
Following various genetic mapping techniques conducted on different segregating populations, one or more genetic maps are obtained for a given species. However, recombination analy...
Denis Bertrand, Mathieu Blanchette, Nadia El-Mabro...
EC
2006
163views ECommerce» more  EC 2006»
15 years 5 months ago
An Extension of Geiringer's Theorem for a Wide Class of Evolutionary Search Algorithms
The frequency with which various elements of the search space of a given evolutionary algorithm are sampled is affected by the family of recombination (reproduction) operators. Th...
Boris Mitavskiy, Jonathan E. Rowe
GECCO
2010
Springer
154views Optimization» more  GECCO 2010»
15 years 10 months ago
Evolutionary learning in networked multi-agent organizations
This study proposes a simple computational model of evolutionary learning in organizations informed by genetic algorithms. Agents who interact only with neighboring partners seek ...
Jae-Woo Kim
AE
2005
Springer
15 years 11 months ago
Size Control with Maximum Homologous Crossover
Most of the Evolutionary Algorithms handling variable-sized structures, like Genetic Programming, tend to produce too long solutions and the recombination operator used is often co...
Michael Defoin-Platel, Manuel Clergue, Philippe Co...