Sciweavers

844 search results - page 69 / 169
» Generalized crowding for genetic algorithms
Sort
View
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
15 years 3 months ago
Finding needles in haystacks is harder with neutrality
This research presents an analysis of the reported successes of the Cartesian Genetic Programming method on a simplified form of the Boolean parity problem. We show the method of...
M. Collins
GECCO
2007
Springer
160views Optimization» more  GECCO 2007»
15 years 4 months ago
Self-modifying cartesian genetic programming
In nature, systems with enormous numbers of components (i.e. cells) are evolved from a relatively small genotype. It has not yet been demonstrated that artificial evolution is su...
Simon Harding, Julian Francis Miller, Wolfgang Ban...
GECCO
2005
Springer
232views Optimization» more  GECCO 2005»
15 years 3 months ago
Factorial representations to generate arbitrary search distributions
A powerful approach to search is to try to learn a distribution of good solutions (in particular of the dependencies between their variables) and use this distribution as a basis ...
Marc Toussaint
GECCO
2006
Springer
218views Optimization» more  GECCO 2006»
15 years 1 months ago
Genetic programming with primitive recursion
When Genetic Programming is used to evolve arithmetic functions it often operates by composing them from a fixed collection of elementary operators and applying them to parameters...
Stefan Kahrs
ICB
2007
Springer
185views Biometrics» more  ICB 2007»
15 years 4 months ago
Biometric Hashing Based on Genetic Selection and Its Application to On-Line Signatures
We present a general biometric hash generation scheme based on vector quantization of multiple feature subsets selected with genetic optimization. The quantization of subsets overc...
Manuel R. Freire, Julian Fiérrez-Aguilar, J...