Sciweavers

4 search results - page 1 / 1
» Pareto-coevolutionary genetic programming for problem decomp...
Sort
View
EUROGP
2007
Springer
145views Optimization» more  EUROGP 2007»
13 years 8 months ago
GP Classifier Problem Decomposition Using First-Price and Second-Price Auctions
This work details an auction-based model for problem decomposition in Genetic Programming classification. The approach builds on the population-based methodology of Genetic Progra...
Peter Lichodzijewski, Malcolm I. Heywood
GPEM
2008
128views more  GPEM 2008»
13 years 4 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
EUROGP
2007
Springer
126views Optimization» more  EUROGP 2007»
13 years 8 months ago
Training Binary GP Classifiers Efficiently: A Pareto-coevolutionary Approach
The conversion and extension of the Incremental Pareto-Coevolution Archive algorithm (IPCA) into the domain of Genetic Programming classification is presented. In particular, the ...
Michal Lemczyk, Malcolm I. Heywood