Sciweavers

3569 search results - page 551 / 714
» On the Evolution of Evolutionary Algorithms
Sort
View
GECCO
2008
Springer
103views Optimization» more  GECCO 2008»
15 years 3 months ago
How generative encodings fare on less regular problems
Generative representations allow the reuse of code and thus facilitate the evolution of repeated phenotypic themes or modules. It has been shown that generative representations pe...
Jeff Clune, Charles Ofria, Robert T. Pennock
GECCO
2008
Springer
201views Optimization» more  GECCO 2008»
15 years 2 months ago
Advanced techniques for the creation and propagation of modules in cartesian genetic programming
The choice of an appropriate hardware representation model is key to successful evolution of digital circuits. One of the most popular models is cartesian genetic programming, whi...
Paul Kaufmann, Marco Platzner
112
Voted
ALIFE
2008
15 years 2 months ago
Natural Selection in Relation to Complexity
, reproductive value, soft selectionAbstract Structural complexity characterizes our representations of dissipative structures. As a mechanistic concept, when referred to natural s...
Stanley N. Salthe
BIB
2008
141views more  BIB 2008»
15 years 2 months ago
Detecting short tandem repeats from genome data: opening the software black box
Short tandem repeats, specifically microsatellites, are widely used genetic markers, associated with human genetic diseases, and play an important role in various regulatory mecha...
Angelika Merkel, Neil Gemmell
GPEM
2000
121views more  GPEM 2000»
15 years 1 months ago
Bayesian Methods for Efficient Genetic Programming
ct. A Bayesian framework for genetic programming GP is presented. This is motivated by the observation that genetic programming iteratively searches populations of fitter programs ...
Byoung-Tak Zhang