Sciweavers

PPSN
2004
Springer
14 years 4 months ago
Hierarchical Genetic Algorithms
Current Genetic Algorithms can efficiently address order-k separable problems, in which the order of the linkage is restricted to a low value k. Outside this class, there exist hie...
Edwin D. de Jong, Dirk Thierens, Richard A. Watson
PPSN
2004
Springer
14 years 4 months ago
Learning Probabilistic Tree Grammars for Genetic Programming
Genetic Programming (GP) provides evolutionary methods for problems with tree representations. A recent development in Genetic Algorithms (GAs) has led to principled algorithms cal...
Peter A. N. Bosman, Edwin D. de Jong
GECCO
2004
Springer
175views Optimization» more  GECCO 2004»
14 years 4 months ago
An Architecture for Massive Parallelization of the Compact Genetic Algorithm
This paper presents an architecture which is suitable for a massive parallelization of the compact genetic algorithm. The approach is scalable, has low synchronization costs, and i...
Fernando G. Lobo, Cláudio F. Lima, Hugo Mar...
GECCO
2004
Springer
114views Optimization» more  GECCO 2004»
14 years 4 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
GECCO
2004
Springer
14 years 4 months ago
The Royal Road Not Taken: A Re-examination of the Reasons for GA Failure on R1
Previous work investigating the performance of genetic algorithms (GAs) has attempted to develop a set of fitness landscapes, called “Royal Roads” functions, which should be id...
Brian Howard, John Sheppard
GECCO
2004
Springer
106views Optimization» more  GECCO 2004»
14 years 4 months ago
Mutation Rates in the Context of Hybrid Genetic Algorithms
Traditionally, the mutation rates of genetic algorithms are fixed or decrease over the generations. Although it seems to be reasonable for classical genetic algorithms, it may not...
Seung-Hee Bae, Byung Ro Moon
GECCO
2004
Springer
14 years 4 months ago
How to Overcome the Equivalent Mutant Problem and Achieve Tailored Selective Mutation Using Co-evolution
The use of Genetic Algorithms in evolution of mutants and test cases offers new possibilities in addressing some of the main problems of mutation testing. Most specifically the p...
Konstantinos Adamopoulos, Mark Harman, Robert M. H...
EVOW
2004
Springer
14 years 4 months ago
Solving the Vehicle Routing Problem by Using Cellular Genetic Algorithms
Cellular Genetic Algorithms (cGAs) are a subclass of Genetic Algorithms (GAs) in which the population diversity and exploration are enhanced thanks to the existence of small overla...
Enrique Alba, Bernabé Dorronsoro
PLDI
2004
ACM
14 years 4 months ago
Fast searches for effective optimization phase sequences
It has long been known that a fixed ordering of optimization phases will not produce the best code for every application. One approach for addressing this phase ordering problem ...
Prasad Kulkarni, Stephen Hines, Jason Hiser, David...
GECCO
2005
Springer
150views Optimization» more  GECCO 2005»
14 years 4 months ago
A GA for maximum likelihood phylogenetic inference using neighbour-joining as a genotype to phenotype mapping
Evolutionary relationships among species can be represented by a phylogenetic tree and inferred by optimising some measure of fitness, such as the statistical likelihood of the t...
Leon Poladian