Foundations of Genetic Algorithms 1991 (FOGA 1) - 1st Edition - ISBN: 9781558601703, 9780080506845

Foundations of Genetic Algorithms 1991 (FOGA 1), Volume 1

1st Edition

Editors: FOGA
Hardcover ISBN: 9781558601703
eBook ISBN: 9780080506845
Imprint: Morgan Kaufmann
Published Date: 1st July 1991
Page Count: 341
Tax/VAT will be calculated at check-out
72.95
43.99
54.95
99.95
Unavailable
Compatible Not compatible
VitalSource PC, Mac, iPhone & iPad Amazon Kindle eReader
ePub & PDF Apple & PC desktop. Mobile devices (Apple & Android) Amazon Kindle eReader
Mobi Amazon Kindle eReader Anything else

Institutional Access


Table of Contents

Part 1: Genetic Algorithm Hardness

The Nonuniform Walsh-Schema Transform

Epistasis Variance: A Viewpoint on GA-Hardness

Deceptiveness and Genetic Algorithm Dynamics

Part 2: Selection and Convergence

An Extension to the Theory of Convergence and a Proof of the Time Complexity of Genetic Algorithms

A Comparative Analysis of Selection Schemes Used in Genetic Algorithms

A Study of Reproduction in Generational and Steady State Genetic Algorithms

Spurious Correlations and Premature Convergence in Genetic Algorithms

Part 3: Classifier Systems

Representing Attribute-Based Concepts in a Classifier System

Quasimorphisms or Queasymorphisms? Modeling Finite Automaton Environments

Variable Default Hierarchy Separation in a Classifier System

Part 4: Coding and Representation

A Hierarchical Approach to Learning the Boolean Multiplexer Function

A Grammar-Based Genetic Algorithm

Genetic Algorithms for Real Parameter Optimization

Part 5: Framework Issues

Fundamental Principles of Deception in Genetic Search

Isomorphisms of Genetic Algorithms

Conditions for Implicit Parallelism

Part 6: Variation and Recombination

The CHC Adaptive Search Algorithm: How to Have Safe Search When Engaging in Nontraditional Genetic Recombination

Genetic Operators for Sequencing Problems

An Analysis of Multi-Point Crossover

Evolution in Time and Space—The Parallel Genetic Algorithm

Author Index

Key Word Index


Description

Part 1: Genetic Algorithm Hardness

The Nonuniform Walsh-Schema Transform

Epistasis Variance: A Viewpoint on GA-Hardness

Deceptiveness and Genetic Algorithm Dynamics

Part 2: Selection and Convergence

An Extension to the Theory of Convergence and a Proof of the Time Complexity of Genetic Algorithms

A Comparative Analysis of Selection Schemes Used in Genetic Algorithms

A Study of Reproduction in Generational and Steady State Genetic Algorithms

Spurious Correlations and Premature Convergence in Genetic Algorithms

Part 3: Classifier Systems

Representing Attribute-Based Concepts in a Classifier System

Quasimorphisms or Queasymorphisms? Modeling Finite Automaton Environments

Variable Default Hierarchy Separation in a Classifier System

Part 4: Coding and Representation

A Hierarchical Approach to Learning the Boolean Multiplexer Function

A Grammar-Based Genetic Algorithm

Genetic Algorithms for Real Parameter Optimization

Part 5: Framework Issues

Fundamental Principles of Deception in Genetic Search

Isomorphisms of Genetic Algorithms

Conditions for Implicit Parallelism

Part 6: Variation and Recombination

The CHC Adaptive Search Algorithm: How to Have Safe Search When Engaging in Nontraditional Genetic Recombination

Genetic Operators for Sequencing Problems

An Analysis of Multi-Point Crossover

Evolution in Time and Space—The Parallel Genetic Algorithm

Author Index

Key Word Index


Details

No. of pages:
341
Language:
English
Copyright:
© Morgan Kaufmann 1991
Published:
Imprint:
Morgan Kaufmann
eBook ISBN:
9780080506845
Hardcover ISBN:
9781558601703

About the Editors