Sciweavers

3136 search results - page 30 / 628
» Genetic programming theory
Sort
View
GECCO
2005
Springer
137views Optimization» more  GECCO 2005»
15 years 3 months ago
Constant generation for the financial domain using grammatical evolution
This study reports the work to date on the analysis of different methodologies for constant creation with the aim of applying the most advantageous method to the dynamic real wor...
Ian Dempsey
GECCO
2007
Springer
293views Optimization» more  GECCO 2007»
15 years 4 months ago
Solving the artificial ant on the Santa Fe trail problem in 20, 696 fitness evaluations
In this paper, we provide an algorithm that systematically considers all small trees in the search space of genetic programming. These small trees are used to generate useful subr...
Steffen Christensen, Franz Oppacher
EUROGP
2007
Springer
145views Optimization» more  EUROGP 2007»
15 years 1 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
GECCO
2005
Springer
175views Optimization» more  GECCO 2005»
15 years 3 months ago
Meta-grammar constant creation with grammatical evolution by grammatical evolution
This study examines the utility of meta-grammar constant generation on a series of benchmark problems. The performance of the meta-grammar approach is compared to a grammar which ...
Ian Dempsey, Michael O'Neill, Anthony Brabazon
GECCO
2009
Springer
156views Optimization» more  GECCO 2009»
15 years 4 months ago
Characterizing the genetic programming environment for fifth (GPE5) on a high performance computing cluster
Solving complex, real-world problems with genetic programming (GP) can require extensive computing resources. However, the highly parallel nature of GP facilitates using a large n...
Kenneth Holladay