Sciweavers

602 search results - page 1 / 121
» Unsupervised Problem Decomposition Using Genetic Programming
Sort
View
EUROGP
2010
Springer
182views Optimization» more  EUROGP 2010»
13 years 10 months ago
Unsupervised Problem Decomposition Using Genetic Programming
We propose a new framework based on Genetic Programming (GP) to automatically decompose problems into smaller and simpler tasks. The framework uses GP at two levels. At the top lev...
Ahmed Kattan, Alexandros Agapitos, Riccardo Poli
EUROGP
2007
Springer
145views Optimization» more  EUROGP 2007»
14 years 13 days 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
GECCO
1999
Springer
106views Optimization» more  GECCO 1999»
14 years 24 days ago
Generating Lemmas for Tableau-based Proof Search Using Genetic Programming
Top-down or analytical provers based on the connection tableau calculus are rather powerful, yet have notable shortcomings regarding redundancy control. A well-known and successfu...
Marc Fuchs, Dirk Fuchs, Matthias Fuchs
GECCO
2008
Springer
141views Optimization» more  GECCO 2008»
13 years 9 months ago
Managing team-based problem solving with symbiotic bid-based genetic programming
Bid-based Genetic Programming (GP) provides an elegant mechanism for facilitating cooperative problem decomposition without an a priori specification of the number of team member...
Peter Lichodzijewski, Malcolm I. Heywood
GPEM
2008
128views more  GPEM 2008»
13 years 8 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