Sciweavers

669 search results - page 127 / 134
» An evolutionary method for complex-process optimization
Sort
View
GECCO
2005
Springer
112views Optimization» more  GECCO 2005»
15 years 6 months ago
Towards an empirical measure of evolvability
Genetic representations that do not employ a one-to-one mapping of genotype to phenotype are known as indirect encodings, and can be much more efficient than direct encodings for ...
Joseph Reisinger, Kenneth O. Stanley, Risto Miikku...
GECCO
2005
Springer
159views Optimization» more  GECCO 2005»
15 years 6 months ago
Resource-limited genetic programming: the dynamic approach
Resource-Limited Genetic Programming is a bloat control technique that imposes a single limit on the total amount of resources available to the entire population, where resources ...
Sara Silva, Ernesto Costa
GECCO
2004
Springer
15 years 5 months ago
Shortcomings with Tree-Structured Edge Encodings for Neural Networks
In evolutionary algorithms a common method for encoding neural networks is to use a tree-structured assembly procedure for constructing them. Since node operators have difficulties...
Gregory Hornby
GECCO
2003
Springer
127views Optimization» more  GECCO 2003»
15 years 5 months ago
Complex Function Sets Improve Symbolic Discriminant Analysis of Microarray Data
Abstract. Our ability to simultaneously measure the expression levels of thousands of genes in biological samples is providing important new opportunities for improving the diagnos...
David M. Reif, Bill C. White, Nancy Olsen, Thomas ...
CEC
2010
IEEE
14 years 9 months ago
Differential evolution with ensemble of constraint handling techniques for solving CEC 2010 benchmark problems
Several constraint handling techniques have been proposed to be used with the evolutionary algorithms (EAs). According to the no free lunch theorem, it is impossible for a single c...
Rammohan Mallipeddi, Ponnuthurai Nagaratnam Sugant...