Sciweavers

895 search results - page 51 / 179
» An Indirect Genetic Algorithm for Set Covering Problems
Sort
View
153
Voted
IWOCA
2009
Springer
149views Algorithms» more  IWOCA 2009»
16 years 21 days ago
Randomized Postoptimization of Covering Arrays
The construction of covering arrays with the fewest rows remains a challenging problem. Most computational and recursive constructions result in extensive repetition of coverage. W...
Peyman Nayeri, Charles J. Colbourn, Goran Konjevod
GECCO
2004
Springer
114views Optimization» more  GECCO 2004»
15 years 11 months ago
Hybrid Genetic Algorithms for Multi-Objective Optimisation of Water Distribution Networks
Abstract. Genetic algorithms have been a standard technique for engineers optimising water distribution networks for some time. However in recent years there has been an increasing...
Ed Keedwell, Soon-Thiam Khu
183
Voted
GECCO
1999
Springer
15 years 10 months ago
A parameter-less genetic algorithm
From the user’s point of view, setting the parameters of a genetic algorithm (GA) is far from a trivial task. Moreover, the user is typically not interested in population sizes,...
Georges R. Harik, Fernando G. Lobo
CORR
2008
Springer
63views Education» more  CORR 2008»
15 years 6 months ago
Two Remarkable Computational Competencies of the Simple Genetic Algorithm
Since the inception of genetic algorithmics the identification of computational efficiencies of the simple genetic algorithm (SGA) has been an important goal. In this paper we dist...
Keki M. Burjorjee
GECCO
2007
Springer
151views Optimization» more  GECCO 2007»
16 years 10 days ago
Solving real-valued optimisation problems using cartesian genetic programming
Classical Evolutionary Programming (CEP) and Fast Evolutionary Programming (FEP) have been applied to realvalued function optimisation. Both of these techniques directly evolve th...
James Alfred Walker, Julian Francis Miller