Evolutionary Algorithms [electronic resource] : The Role of Mutation and Recombination /

Despite decades of work in evolutionary algorithms, there remains a lot of uncertainty as to when it is beneficial or detrimental to use recombination or mutation. This book provides a characterization of the roles that recombination and mutation play in evolutionary algorithms. It integrates prior theoretical work and introduces new theoretical techniques for studying evolutionary algorithms. An aggregation algorithm for Markov chains is introduced which is useful for studying not only evolutionary algorithms specifically, but also complex systems in general. Practical consequences of the theory are explored and a novel method for comparing search and optimization algorithms is introduced. A focus on discrete rather than real-valued representations allows the book to bridge multiple communities, including evolutionary biologists and population geneticists.

Saved in:
Bibliographic Details
Main Authors: Spears, William M. author., SpringerLink (Online service)
Format: Texto biblioteca
Language:eng
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2000
Subjects:Computer science., Algorithms., Computer science, Artificial intelligence., Bioinformatics., Computational biology., Evolutionary biology., Mathematical logic., Computer Science., Artificial Intelligence (incl. Robotics)., Mathematical Logic and Foundations., Evolutionary Biology., Algorithm Analysis and Problem Complexity., Mathematics of Computing., Computer Appl. in Life Sciences.,
Online Access:http://dx.doi.org/10.1007/978-3-662-04199-4
Tags: Add Tag
No Tags, Be the first to tag this record!
id KOHA-OAI-TEST:172608
record_format koha
spelling KOHA-OAI-TEST:1726082018-07-30T22:50:04ZEvolutionary Algorithms [electronic resource] : The Role of Mutation and Recombination / Spears, William M. author. SpringerLink (Online service) textBerlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer,2000.engDespite decades of work in evolutionary algorithms, there remains a lot of uncertainty as to when it is beneficial or detrimental to use recombination or mutation. This book provides a characterization of the roles that recombination and mutation play in evolutionary algorithms. It integrates prior theoretical work and introduces new theoretical techniques for studying evolutionary algorithms. An aggregation algorithm for Markov chains is introduced which is useful for studying not only evolutionary algorithms specifically, but also complex systems in general. Practical consequences of the theory are explored and a novel method for comparing search and optimization algorithms is introduced. A focus on discrete rather than real-valued representations 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.Despite decades of work in evolutionary algorithms, there remains a lot of uncertainty as to when it is beneficial or detrimental to use recombination or mutation. This book provides a characterization of the roles that recombination and mutation play in evolutionary algorithms. It integrates prior theoretical work and introduces new theoretical techniques for studying evolutionary algorithms. An aggregation algorithm for Markov chains is introduced which is useful for studying not only evolutionary algorithms specifically, but also complex systems in general. Practical consequences of the theory are explored and a novel method for comparing search and optimization algorithms is introduced. A focus on discrete rather than real-valued representations allows the book to bridge multiple communities, including evolutionary biologists and population geneticists.Computer science.Algorithms.Computer scienceArtificial intelligence.Bioinformatics.Computational biology.Evolutionary biology.Mathematical logic.Computer Science.Artificial Intelligence (incl. Robotics).Mathematical Logic and Foundations.Evolutionary Biology.Algorithm Analysis and Problem Complexity.Mathematics of Computing.Computer Appl. in Life Sciences.Springer eBookshttp://dx.doi.org/10.1007/978-3-662-04199-4URN:ISBN:9783662041994
institution COLPOS
collection Koha
country México
countrycode MX
component Bibliográfico
access En linea
En linea
databasecode cat-colpos
tag biblioteca
region America del Norte
libraryname Departamento de documentación y biblioteca de COLPOS
language eng
topic Computer science.
Algorithms.
Computer science
Artificial intelligence.
Bioinformatics.
Computational biology.
Evolutionary biology.
Mathematical logic.
Computer Science.
Artificial Intelligence (incl. Robotics).
Mathematical Logic and Foundations.
Evolutionary Biology.
Algorithm Analysis and Problem Complexity.
Mathematics of Computing.
Computer Appl. in Life Sciences.
Computer science.
Algorithms.
Computer science
Artificial intelligence.
Bioinformatics.
Computational biology.
Evolutionary biology.
Mathematical logic.
Computer Science.
Artificial Intelligence (incl. Robotics).
Mathematical Logic and Foundations.
Evolutionary Biology.
Algorithm Analysis and Problem Complexity.
Mathematics of Computing.
Computer Appl. in Life Sciences.
spellingShingle Computer science.
Algorithms.
Computer science
Artificial intelligence.
Bioinformatics.
Computational biology.
Evolutionary biology.
Mathematical logic.
Computer Science.
Artificial Intelligence (incl. Robotics).
Mathematical Logic and Foundations.
Evolutionary Biology.
Algorithm Analysis and Problem Complexity.
Mathematics of Computing.
Computer Appl. in Life Sciences.
Computer science.
Algorithms.
Computer science
Artificial intelligence.
Bioinformatics.
Computational biology.
Evolutionary biology.
Mathematical logic.
Computer Science.
Artificial Intelligence (incl. Robotics).
Mathematical Logic and Foundations.
Evolutionary Biology.
Algorithm Analysis and Problem Complexity.
Mathematics of Computing.
Computer Appl. in Life Sciences.
Spears, William M. author.
SpringerLink (Online service)
Evolutionary Algorithms [electronic resource] : The Role of Mutation and Recombination /
description Despite decades of work in evolutionary algorithms, there remains a lot of uncertainty as to when it is beneficial or detrimental to use recombination or mutation. This book provides a characterization of the roles that recombination and mutation play in evolutionary algorithms. It integrates prior theoretical work and introduces new theoretical techniques for studying evolutionary algorithms. An aggregation algorithm for Markov chains is introduced which is useful for studying not only evolutionary algorithms specifically, but also complex systems in general. Practical consequences of the theory are explored and a novel method for comparing search and optimization algorithms is introduced. A focus on discrete rather than real-valued representations allows the book to bridge multiple communities, including evolutionary biologists and population geneticists.
format Texto
topic_facet Computer science.
Algorithms.
Computer science
Artificial intelligence.
Bioinformatics.
Computational biology.
Evolutionary biology.
Mathematical logic.
Computer Science.
Artificial Intelligence (incl. Robotics).
Mathematical Logic and Foundations.
Evolutionary Biology.
Algorithm Analysis and Problem Complexity.
Mathematics of Computing.
Computer Appl. in Life Sciences.
author Spears, William M. author.
SpringerLink (Online service)
author_facet Spears, William M. author.
SpringerLink (Online service)
author_sort Spears, William M. author.
title Evolutionary Algorithms [electronic resource] : The Role of Mutation and Recombination /
title_short Evolutionary Algorithms [electronic resource] : The Role of Mutation and Recombination /
title_full Evolutionary Algorithms [electronic resource] : The Role of Mutation and Recombination /
title_fullStr Evolutionary Algorithms [electronic resource] : The Role of Mutation and Recombination /
title_full_unstemmed Evolutionary Algorithms [electronic resource] : The Role of Mutation and Recombination /
title_sort evolutionary algorithms [electronic resource] : the role of mutation and recombination /
publisher Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer,
publishDate 2000
url http://dx.doi.org/10.1007/978-3-662-04199-4
work_keys_str_mv AT spearswilliammauthor evolutionaryalgorithmselectronicresourcetheroleofmutationandrecombination
AT springerlinkonlineservice evolutionaryalgorithmselectronicresourcetheroleofmutationandrecombination
_version_ 1756263612081504256