Sciweavers

835 search results - page 41 / 167
» Dynamic populations in genetic algorithms
Sort
View
77
Voted
GECCO
2005
Springer
106views Optimization» more  GECCO 2005»
15 years 6 months ago
Fitness uniform deletion: a simple way to preserve diversity
A commonly experienced problem with population based optimisation methods is the gradual decline in population diversity that tends to occur over time. This can slow a system’s ...
Shane Legg, Marcus Hutter
100
Voted
ACRI
2008
Springer
15 years 6 months ago
GP Generation of Pedestrian Behavioral Rules in an Evacuation Model Based on SCA
This paper presents a research in the context of pedestrian dynamics according to Situated Cellular Agent (SCA), a Multi-Agent Systems approach whose roots are on Cellular Automata...
Stefania Bandini, Sara Manzoni, Giancarlo Mauri, S...
101
Voted
WSC
2007
15 years 2 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
BMCBI
2010
62views more  BMCBI 2010»
15 years 18 days ago
Forward-time simulation of realistic samples for genome-wide association studies
Background: Forward-time simulations have unique advantages in power and flexibility for the simulation of genetic samples of complex human diseases because they can closely mimic...
Bo Peng, Christopher I. Amos
128
Voted
SPDP
1991
IEEE
15 years 4 months ago
Asynchronous parallel search by the parallel genetic algorithm
The parallel genetic algorithm (PGA) is a prototype of a new kind of a distributed algorithm. It is based on a parallel search by individuals all of which have the complete proble...
Heinz Mühlenbein