Sciweavers

1614 search results - page 59 / 323
» Polymorphism and Genetic Programming
Sort
View
GECCO
2007
Springer
293views Optimization» more  GECCO 2007»
14 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»
14 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
ICFP
2004
ACM
14 years 10 months ago
Translating dependency into parametricity
Abadi et al. introduced the dependency core calculus (DCC) as a unifying framework to study many important program analyses such as binding time, information flow, slicing, and fu...
Stephen Tse, Steve Zdancewic
POPL
2003
ACM
14 years 3 months ago
From control effects to typed continuation passing
First-class continuations are a powerful computational effect, allowing the programmer to express any form of jumping. Types and effect systems can be used to reason about contin...
Hayo Thielecke
GECCO
2009
Springer
156views Optimization» more  GECCO 2009»
14 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