Sciweavers

1310 search results - page 79 / 262
» A parallel genetic algorithm to solve the set-covering probl...
Sort
View
GECCO
2010
Springer
207views Optimization» more  GECCO 2010»
15 years 2 months 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
IPPS
2007
IEEE
15 years 4 months ago
Applying Ant Colony Optimization Metaheuristic to the DAG Layering Problem
— This paper1 presents the design and implementation of an Ant Colony Optimization based algorithm for solving the DAG Layering Problem. This algorithm produces compact layerings...
Radoslav Andreev, Patrick Healy, Nikola S. Nikolov
SAC
2006
ACM
15 years 3 months ago
Adaptive mutation with fitness and allele distribution correlation for genetic algorithms
In this paper, a new gene based adaptive mutation scheme is proposed for genetic algorithms (GAs), where the information on gene based fitness statistics and on gene based allele...
Shengxiang Yang, Sima Uyar
KBSE
1997
IEEE
15 years 2 months ago
Genetic Algorithms for Dynamic Test Data Generation
In software testing, it is often desirable to find test inputs that exercise specific program features. To find these inputs by hand is extremely time-consuming, especially whe...
Christoph C. Michael, Gary McGraw, Michael Schatz,...
GECCO
2006
Springer
135views Optimization» more  GECCO 2006»
15 years 1 months ago
A tree-based genetic algorithm for building rectilinear Steiner arborescences
A rectilinear Steiner arborescence (RSA) is a tree, whose nodes include a prescribed set of points, termed the vertices, in the first quadrant of the Cartesian plane, and whose tr...
William A. Greene