Sciweavers

340 search results - page 13 / 68
» A computational view of population genetics
Sort
View
EC
2002
228views ECommerce» more  EC 2002»
13 years 8 months ago
Improved Sampling of the Pareto-Front in Multiobjective Genetic Optimizations by Steady-State Evolution: A Pareto Converging Gen
Previous work on multiobjective genetic algorithms has been focused on preventing genetic drift and the issue of convergence has been given little attention. In this paper, we pre...
Rajeev Kumar, Peter Rockett
PPSN
1992
Springer
14 years 19 days ago
Nonstationary Function Optimization using the Structured Genetic Algorithm
In this paper, we describe the application of a new type of genetic algorithm called the Structured Genetic Algorithm (sGA) for function optimization in nonstationary environments...
Dipankar Dasgupta, Douglas R. McGregor
WSC
2007
13 years 11 months ago
Subset selection and optimization for selecting binomial systems applied to supersaturated design generation
The problem of finding the binomial population with the highest success probability is considered when the number of binomial populations is large. A new rigorous indifference zo...
Ning Zheng, Theodore Allen
CSB
2003
IEEE
14 years 1 months ago
Haplotype Motifs: An Algorithmic Approach to Locating Evolutionarily Conserved Patterns in Haploid Sequences
The promise of plentiful data on common human genetic variations has given hope that we will be able to uncover genetic factors behind common diseases that have proven difficult ...
Russell Schwartz
SAC
1998
ACM
14 years 25 days ago
Scalability of an MPI-based fast messy genetic algorithm
The fast messy genetic algorithm (fmGA) belongs to a class of algorithms inspired by the principles of evolution, known appropriately as "evolutionary algorithms" (EAs)....
Laurence D. Merkle, George H. Gates Jr., Gary B. L...