Sciweavers

117 search results - page 7 / 24
» Optimal Mutation Rates and Selection Pressure in Genetic Alg...
Sort
View
APIN
2000
120views more  APIN 2000»
13 years 7 months ago
Two-Loop Real-Coded Genetic Algorithms with Adaptive Control of Mutation Step Sizes
Genetic algorithms are adaptive methods based on natural evolution that may be used for search and optimization problems. They process a population of search space solutions with t...
Francisco Herrera, Manuel Lozano
GECCO
2010
Springer
207views Optimization» more  GECCO 2010»
14 years 13 days ago
Generalized crowding for genetic algorithms
Crowding is a technique used in genetic algorithms to preserve diversity in the population and to prevent premature convergence to local optima. It consists of pairing each offsp...
Severino F. Galán, Ole J. Mengshoel
GECCO
2007
Springer
164views Optimization» more  GECCO 2007»
14 years 1 months ago
A study of mutational robustness as the product of evolutionary computation
This paper investigates the ability of a tournament selection based genetic algorithm to find mutationally robust solutions to a simple combinatorial optimization problem. Two di...
Justin Schonfeld
ASPDAC
1999
ACM
157views Hardware» more  ASPDAC 1999»
13 years 12 months ago
A Genetic Algorithm based Approach for Multi-Objective Data-Flow Graph Optimization
: This paper presents a genetic algorithm based approach for algebraic optimization of behavioral system specifications. We introduce a chromosomal representation of data-flow gr...
Birger Landwehr
GECCO
2004
Springer
124views Optimization» more  GECCO 2004»
14 years 1 months ago
A Statistical Model of GA Dynamics for the OneMax Problem
A model of the dynamics of solving the counting-ones (OneMax) problem using a simple genetic algorithm (GA) is developed. It uses statistics of the early generations of GA runs to ...
Bulent Buyukbozkirli, Erik D. Goodman