Sciweavers

8 search results - page 1 / 2
» Scalability of Selectorecombinative Genetic Algorithms for P...
Sort
View
GECCO
2003
Springer
13 years 10 months ago
Scalability of Selectorecombinative Genetic Algorithms for Problems with Tight Linkage
Ensuring building-block (BB) mixing is critical to the success of genetic and evolutionary algorithms. This study develops facetwise models to predict the BB mixing time and the po...
Kumara Sastry, David E. Goldberg
GECCO
2007
Springer
132views Optimization» more  GECCO 2007»
13 years 11 months ago
Empirical analysis of ideal recombination on random decomposable problems
This paper analyzes the behavior of a selectorecombinative genetic algorithm (GA) with an ideal crossover on a class of random additively decomposable problems (rADPs). Specifical...
Kumara Sastry, Martin Pelikan, David E. Goldberg
CORR
2004
Springer
108views Education» more  CORR 2004»
13 years 4 months ago
Efficiency Enhancement of Probabilistic Model Building Genetic Algorithms
Abstract. This paper presents two different efficiency-enhancement techniques for probabilistic model building genetic algorithms. The first technique proposes the use of a mutatio...
Kumara Sastry, David E. Goldberg, Martin Pelikan
CEC
2005
IEEE
13 years 10 months ago
Linear genetic programming using a compressed genotype representation
This paper presents a modularization strategy for linear genetic programming (GP) based on a substring compression/substitution scheme. The purpose of this substitution scheme is t...
Johan Parent, Ann Nowé, Kris Steenhaut, Ann...
IPPS
2002
IEEE
13 years 9 months ago
Parallel Genehunter: Implementation of a Linkage Analysis Package for Distributed-Memory Architectures
We present a parallel algorithm for performing multipoint linkage analysis of genetic marker data on large family pedigrees. The algorithm effectively distributes both the computa...
Gavin C. Conant, Steve Plimpton, William Old, Andr...