Foundations of Genetic Algorithms 4Richard K. Belew, Michael D. Vose Elsevier Science & Technology Books, 1997 - 463 Seiten |
Inhalt
INTRODUCTION | 1 |
A Further Result on the Markov Chain Model of Genetic Algorithms and | 53 |
A Search for Counterexamples to Two Conjectures on the Simple Genetic Algorithm | 73 |
Urheberrecht | |
16 weitere Abschnitte werden nicht angezeigt.
Häufige Begriffe und Wortgruppen
alleles analysis average fitness binary bits chromosome column complete derivation trees computed consider context-free convergence crossover correlation crossover operators cumulants deceptive decomposition defined denote derivation steps distribution domain dynamics effects encoding epistasis EPSAs equation evaluation evolution evolutionary algorithms example Figure finite fitness function fitness landscapes genes Genetic Algorithms genetic operators genotype given global optimization Goldberg grammar graph Gray coding Hamming distance hypercube hyperplanes individual infinite population linear linkage M₂ Markov chain matrix measure mutation nonterminal offspring optimal building block optimum pair-wise CCVA parameter parents partition pattern search methods performance pool-wise CCVA problem production Prügel-Bennett random randomly recombination relations replicator representation sample search space selection Shapiro simple genetic algorithm simulated annealing solution static ranking statistic strings subset symbol Table terminal symbols Theorem theory Torczon uniform crossover vector Vose w₁ Walsh coefficients
Verweise auf dieses Buch
An Introduction to Genetic Algorithms for Scientists and Engineers David A. Coley Eingeschränkte Leseprobe - 1999 |