Sciweavers

895 search results - page 30 / 179
» An Indirect Genetic Algorithm for Set Covering Problems
Sort
View
GECCO
2004
Springer
124views Optimization» more  GECCO 2004»
14 years 3 months ago
A Statistical Model of GA Dynamics for the OneMax Problem
A model of the dynamics of solving the counting-ones (OneMax) problem using a simple genetic algorithm (GA) is developed. It uses statistics of the early generations of GA runs to ...
Bulent Buyukbozkirli, Erik D. Goodman
GECCO
2006
Springer
166views Optimization» more  GECCO 2006»
14 years 1 months ago
Comparing genetic robustness in generational vs. steady state evolutionary algorithms
Previous research has shown that evolutionary systems not only try to develop solutions that satisfy a fitness requirement, but indirectly attempt to develop genetically robust so...
Josh Jones, Terry Soule
ECAL
2007
Springer
14 years 4 months ago
Genotype Editing and the Evolution of Regulation and Memory
Our agent-based model of genotype editing is defined by two distinct genetic components: a coding portion encoding phenotypic solutions, and a non-coding portion used to edit the ...
Luis Mateus Rocha, Jasleen Kaur
AHSWN
2006
148views more  AHSWN 2006»
13 years 9 months ago
Geometric Chemotaxis: A Biologically-Inspired Framework for a Class of Wireless Coverage Problems
Abstract-- We present a new, biologically-inspired algorithm for the problem of covering a given region with wireless "units" (sensors or base-stations). The general prob...
Hidayet Ozgur Sanli, Rahul Simha, Bhagirath Naraha...
GPEM
2006
97views more  GPEM 2006»
13 years 9 months ago
Evolving recursive programs by using adaptive grammar based genetic programming
Genetic programming (GP) extends traditional genetic algorithms to automatically induce computer programs. GP has been applied in a wide range of applications such as software ree...
Man Wong