Sciweavers

15 search results - page 1 / 3
» Threshold selecting: best possible probability distribution ...
Sort
View
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
13 years 6 months ago
Threshold selecting: best possible probability distribution for crossover selection in genetic algorithms
The paper considers the problem of selecting individuals in the current population in Genetic Algorithms for crossover to find a solution of high fitness of a given combinatoria...
Jörg Lässig, Karl Heinz Hoffmann, Mihael...
CEC
2005
IEEE
13 years 6 months ago
A new approach to dynamics analysis of genetic algorithms without selection
Abstract- Theoretical analysis of the dynamics of evolutionary algorithms is believed to be very important to understand the search behavior of evolutionary algorithms and to devel...
Tatsuya Okabe, Yaochu Jin, Bernhard Sendhoff
GECCO
2000
Springer
112views Optimization» more  GECCO 2000»
13 years 8 months ago
Code Compaction Using Genetic Algorithms
One method for compacting executable computer code is to replace commonly repeated sequences of instructions with macro instructions from a decoding dictionary. The size of the de...
Keith E. Mathias, Larry J. Eshelman, J. David Scha...
GECCO
2006
Springer
185views Optimization» more  GECCO 2006»
13 years 8 months ago
Convergence to global optima for genetic programming systems with dynamically scaled operators
This work shows asymptotic convergence to global optima for a family of dynamically scaled genetic programming systems where the underlying population consists of a fixed number o...
Lothar M. Schmitt, Stefan Droste
RSCTC
2000
Springer
126views Fuzzy Logic» more  RSCTC 2000»
13 years 8 months ago
Evolutionary Parsing for a Probabilistic Context Free Grammar
Abstract. Classic parsing methods are based on complete search techniques to find the different interpretations of a sentence. However, the size of the search space increases expon...
Lourdes Araujo