Sciweavers

6 search results - page 1 / 2
» Behavior of finite population variable length genetic algori...
Sort
View
GECCO
2005
Springer
141views Optimization» more  GECCO 2005»
13 years 10 months ago
Behavior of finite population variable length genetic algorithms under random selection
In this work we provide empirical evidence that shows how a variable-length genetic algorithm (GA) can naturally evolve shorter average size populations. This reduction in chromos...
Hal Stringer, Annie S. Wu
GECCO
2006
Springer
154views Optimization» more  GECCO 2006»
13 years 8 months ago
Emergent mating topologies in spatially structured genetic algorithms
The application of network analysis to emergent mating topologies in spatially structured genetic algorithms is presented in this preliminary study as a framework for inferring ev...
Joshua L. Payne, Margaret J. Eppstein
GECCO
2006
Springer
152views Optimization» more  GECCO 2006»
13 years 8 months ago
Strong recombination, weak selection, and mutation
We show that there are unimodal fitness functions and genetic algorithm (GA) parameter settings where the GA, when initialized with a random population, will not move close to the...
Alden H. Wright, J. Neal Richter
EC
2006
163views ECommerce» more  EC 2006»
13 years 4 months ago
An Extension of Geiringer's Theorem for a Wide Class of Evolutionary Search Algorithms
The frequency with which various elements of the search space of a given evolutionary algorithm are sampled is affected by the family of recombination (reproduction) operators. Th...
Boris Mitavskiy, Jonathan E. Rowe
IJCAI
2007
13 years 6 months ago
Adaptive Genetic Algorithm with Mutation and Crossover Matrices
A matrix formulation for an adaptive genetic algorithm is developed using mutation matrix and crossover matrix. Selection, mutation, and crossover are all parameter-free in the se...
Nga Lam Law, Kwok Yip Szeto