Sciweavers

6943 search results - page 3 / 1389
» Representations for evolutionary algorithms
Sort
View
GECCO
2000
Springer
114views Optimization» more  GECCO 2000»
13 years 11 months ago
Variable Length Genomes for Evolutionary Algorithms
A general variable length genome, called exG, is developed here to address the problems of fixed length representations in canonical evolutionary algorithms. Convergence aspects o...
C.-Y. Lee, E. K. Antonsson
IJIT
2004
13 years 8 months ago
Memetic Algorithm Based Path Planning for a Mobile Robot
In this paper, the problem of finding the optimal collision free path for a mobile robot, the path planning problem, is solved using an advanced evolutionary algorithm called memet...
Neda Shahidi, Hadi Esmaeilzadeh, Marziye Abdollahi...
GECCO
2008
Springer
119views Optimization» more  GECCO 2008»
13 years 8 months ago
Evolutionary synthesis of low-sensitivity equalizers using adjacency matrix representation
An evolutionary synthesis method to design low-sensitivity IIR filters with linear phase in the passband is presented. The method uses a chromosome coding scheme based on the grap...
Leonardo Bruno de Sá, Antonio Carneiro Mesq...
GECCO
2003
Springer
14 years 18 days ago
A Case for Codons in Evolutionary Algorithms
A new method is developed for representation and encoding in population-based evolutionary algorithms. The method is inspired by the biological genetic code and utilizes a many-to-...
Joshua Gilbert, Margaret J. Eppstein
GECCO
2003
Springer
14 years 18 days ago
Generative Representations for Evolving Families of Designs
Abstract. Since typical evolutionary design systems encode only a single artifact with each individual, each time the objective changes a new set of individuals must be evolved. Wh...
Gregory Hornby