Sciweavers

895 search results - page 89 / 179
» An Indirect Genetic Algorithm for Set Covering Problems
Sort
View
EC
2010
127views ECommerce» more  EC 2010»
14 years 8 months ago
Representation Invariant Genetic Operators
A genetic algorithm is invariant with respect to a set of representations if it runs the same no matter which of the representations is used. We formalize this concept mathematica...
Jonathan E. Rowe, Michael D. Vose, Alden H. Wright
PPSN
2000
Springer
15 years 2 months ago
A Hybrid GA for the Edge-Biconnectivity Augmentation Problem
In the design of communication networks, robustness against failures in single links or nodes is an important issue. This paper proposes a new approach for the NP-complete edge-bic...
Ivana Ljubic, Günther R. Raidl, Jozef Kratica
98
Voted
RECOMB
2005
Springer
15 years 11 months ago
Improved Recombination Lower Bounds for Haplotype Data
Recombination is an important evolutionary mechanism responsible for the genetic diversity in humans and other organisms. Recently, there has been extensive research on understandi...
Vineet Bafna, Vikas Bansal
EC
2008
153views ECommerce» more  EC 2008»
14 years 10 months ago
On Complexity of Optimal Recombination for Binary Representations of Solutions
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...
Anton V. Eremeev
118
Voted
GECCO
2005
Springer
186views Optimization» more  GECCO 2005»
15 years 4 months ago
Subproblem optimization by gene correlation with singular value decomposition
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
Jacob G. Martin