Sciweavers

844 search results - page 97 / 169
» Generalized crowding for genetic algorithms
Sort
View
WIA
2000
Springer
15 years 1 months ago
Fast Implementations of Automata Computations
Abstract. In 6], G. Myers describes a bit-vector algorithm to compute the edit distance between strings. The algorithm converts an input sequence to an output sequence in a paralle...
Anne Bergeron, Sylvie Hamel
GECCO
2008
Springer
112views Optimization» more  GECCO 2008»
14 years 11 months ago
Parameter-less evolutionary search
The paper presents the parameter-less implementation of an evolutionary-based search. It does not need any predefined control parameters values, which are usually used for geneti...
Gregor Papa
GECCO
2004
Springer
124views Optimization» more  GECCO 2004»
15 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
PPSN
1998
Springer
15 years 2 months ago
The Coevolution of Antibodies for Concept Learning
We present a novel approach to concept learning in which a coevolutionary genetic algorithm is applied to the construction of an immune system whose antibodies can discriminate bet...
Mitchell A. Potter, Kenneth A. De Jong
GECCO
2009
Springer
191views Optimization» more  GECCO 2009»
15 years 4 months ago
Evolvable malware
The concept of artificial evolution has been applied to numerous real world applications in different domains. In this paper, we use this concept in the domain of virology to ev...
Sadia Noreen, Shafaq Murtaza, M. Zubair Shafiq, Mu...