895 search results - page 92 / 179 » An Indirect Genetic Algorithm for Set Covering Problems |
88
Voted
EVOW
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. The implementation of an evolutionary algorithm necessarily involves the selection of an appropriate set of genetic operators. For many real-world problem domains, an inc...
CSB
2004
IEEE
15 years 2 months ago
2004
IEEE
There is considerable interest in computational methods to assist in the use of genetic polymorphism data for locating disease-related genes. Haplotypes, contiguous sets of correl...
COCO
2004
Springer
15 years 2 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
GECCO
2005
Springer
15 years 4 months ago
2005
Springer
We hypothesize that the relationship between parameter settings, speci cally parameters controlling mutation, and performance is non-linear in genetic programs. Genetic programmin...
WABI
2005
Springer
15 years 4 months ago
2005
Springer
d Abstract] Tamir Tuller , Efrat Oron , Erez Makavy , Daniel A. Chamovitz † , and Benny Chor ‡ Tel-Aviv University, Tel-Aviv 69978, Israel. Abstract. We study gene expression d...