Sciweavers

192 search results - page 18 / 39
» Comparison of Performance between Different Selection Strate...
Sort
View
GPEM
2008
128views more  GPEM 2008»
13 years 7 months ago
Coevolutionary bid-based genetic programming for problem decomposition in classification
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
Peter Lichodzijewski, Malcolm I. Heywood
AI
2006
Springer
13 years 7 months ago
Backward-chaining evolutionary algorithms
Starting from some simple observations on a popular selection method in Evolutionary Algorithms (EAs)--tournament selection--we highlight a previously-unknown source of inefficien...
Riccardo Poli, William B. Langdon
LCTRTS
2010
Springer
13 years 5 months ago
Improving both the performance benefits and speed of optimization phase sequence searches
The issues of compiler optimization phase ordering and selection present important challenges to compiler developers in several domains, and in particular to the speed, code size,...
Prasad A. Kulkarni, Michael R. Jantz, David B. Wha...
RECOMB
2000
Springer
13 years 11 months ago
Contig selection in physical mapping
In physical mapping, one orders a set of genetic landmarks or a library of cloned fragments of DNA according to their position in the genome. Our approach to physical mapping divi...
Steffen Heber, Jens Stoye, Jörg D. Hoheisel, ...
GECCO
2005
Springer
103views Optimization» more  GECCO 2005»
14 years 1 months ago
Pricing the 'free lunch' of meta-evolution
A number of recent studies introduced meta-evolutionary strategies and successfully used them for solving problems in genetic programming. While individual results indicate possib...
Alexei V. Samsonovich, Kenneth A. De Jong