Sciweavers

196 search results - page 24 / 40
» Assortative Mating in Genetic Algorithms for Dynamic Problem...
Sort
View
GECCO
2007
Springer
195views Optimization» more  GECCO 2007»
13 years 11 months ago
Diverse committees vote for dependable profits
Stock selection for hedge fund portfolios is a challenging problem for Genetic Programming (GP) because the markets (the environment in which the GP solution must survive) are dyn...
Wei Yan, Christopher D. Clack
PDPTA
2007
13 years 9 months ago
Brokering Algorithms for Composing Low Cost Distributed Storage Resources
Abstract In this paper we investigate the composition of cheap network storage resources to meet specific availability and capacity requirements. We show that the problem of find...
Jimmy Secretan, Malachi Lawson, Ladislau Böl&...
GECCO
2006
Springer
173views Optimization» more  GECCO 2006»
13 years 11 months ago
Pareto-coevolutionary genetic programming classifier
The conversion and extension of the Incremental ParetoCoevolution Archive algorithm (IPCA) into the domain of Genetic Programming classifier evolution is presented. In order to ac...
Michal Lemczyk, Malcolm I. Heywood
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
14 years 1 months ago
Distribution replacement: how survival of the worst can out perform survival of the fittest
A new family of "Distribution Replacement” operators for use in steady state genetic algorithms is presented. Distribution replacement enforces the members of the populatio...
Howard Tripp, Phil Palmer
GECCO
2010
Springer
249views Optimization» more  GECCO 2010»
13 years 9 months ago
Towards improved dispatching rules for complex shop floor scenarios: a genetic programming approach
Developing dispatching rules for manufacturing systems is a tedious process, which is time- and cost-consuming. Since there is no good general rule for different scenarios and ob...
Torsten Hildebrandt, Jens Heger, Bernd Scholz-Reit...