Contact Us Need Help? Call us 1800-987-323
Explore Departments
  Free shipping Australia wide

Evolutionary Algorithms

Despite decades of work in evolutionary algorithms, there remains an uncertainty as to the relative benefits and detriments of using recombination or mutation. This book provides a characterization of the roles that recombination and mutation play in evolutionary algorithms. It integrates important prior work and introduces new theoretical techniques for studying evolutionary algorithms. Consequences of the theory are explored and a novel method for comparing search and optimization algorithms is introduced. The focus allows the book to bridge multiple communities, including evolutionary biologists and population geneticists.
Evolutionary Algorithms
Product Unavailable
Despite decades of work in evolutionary algorithms, there remains an uncertainty as to the relative benefits and detriments of using recombination or mutation. This book provides a characterization of the roles that recombination and mutation play in evolutionary algorithms. It integrates important prior work and introduces new theoretical techniques for studying evolutionary algorithms. Consequences of the theory are explored and a novel method for comparing search and optimization algorithms is introduced. The focus allows the book to bridge multiple communities, including evolutionary biologists and population geneticists.
I. Setting the Stage.- 1. Introduction.- 2. Background.- II. Static Theoretical Analyses.- 3. A Survival Schema Theory for Recombination.- 4. A Construction Schema Theory for Recombination.- 5. Survival and Construction Schema Theory for Recombination.- 6. A Survival Schema Theory for Mutation.- 7. A Construction Schema Theory for Mutation.- 8. Schema Theory: Mutation versus Recombination.- 9. Other Static Characterizations of Mutation and Recombination.- III. Dynamic Theoretical Analyses.- 10. Dynamic Analyses of Mutation and Recombination.- 11. A Dynamic Model of Selection and Mutation.- 12. A Dynamic Model of Selection, Recombination, and Mutation.- 13. An Aggregation Algorithm for Markov Chains.- IV. Empirical Analyses.- 14. Empirical Validation.- V. Summary.- 15. Summary and Discussion.- Appendix: Formal Computations for Aggregation.- References.
Author
William M. Spears
Publisher
Springer-verlag Berlin And Heidelberg Gmbh & Co. Kg
Series
Natural Computing Series
Year
2010
ISBN-10
3642086241
ISBN-13
9783642086243
Format
Paperback
Imprint
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Place of Publication
Berlin
Country of Publication
Germany
DEWEY
005.1
Edition
1st
Short Title
EVOLUTIONARY ALGORITHMS
Language
English
Media
Book
Birth
1962
Illustrations
21 black & white tables, biography
Publication Date
2010-12-09
Edition Description
Softcover of Or
Pages
236
FREE DELIVERY

Delivery is free to any Australian address. No matter where your item is going.

SECURE PAYMENT

We use 100% PCI DSS compliant payment services. That means your payment information is always protected, and never gets seen by anyone.

30 DAY RETURN POLICY

Return any item within 30 days of delivery. It doesn’t matter why you want to return your item, you can free of charge!