Form Invariance and Implicit Parallelism

Authors:
Michael D. Vose;Alden H. Wright
Affiliations:
Computer Science Department, 107 Ayres Hall, University of Tennessee, Knoxville, TN 37996-1301, USA;Computer Science Department, University of Montana, Missoula, MT 59812-1008, USA
Venue:
Evolutionary Computation
Year:
2001

Citing 8
Cited 9

An analysis of reproduction and crossover in a binary-coded genetic algorithm

Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
The Simple Genetic Algorithm: Foundations and Theory

The Simple Genetic Algorithm: Foundations and Theory
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
A Critical Examination of the Schema Theorem

A Critical Examination of the Schema Theorem
General cardinality genetic algorithms

Evolutionary Computation
The simple genetic algorithm and the walsh transform: Part i, theory

Evolutionary Computation
The simple genetic algorithm and the walsh transform: Part ii, the inverse

Evolutionary Computation

Hyperplane ranking, nonlinearity and the simple genetic algorithm

Information Sciences: an International Journal - Special issue: Evolutionary computation
Theory of genetic algorithms II: models for genetic operators over the string-tensor representation of populations and convergence to global optima for arbitrary fitness function under scaling

Theoretical Computer Science
Structural Search Spaces and Genetic Operators

Evolutionary Computation
Crossover Invariant Subsets of the Search Space for Evolutionary Algorithms

Evolutionary Computation
Covariant Genetic Dynamics

Evolutionary Computation
Implicit parallelism

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
Coarse-graining in genetic algorithms: some issues and examples

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Multicriterion Market Segmentation: A New Model, Implementation, and Evaluation

Marketing Science
NP-Completeness of deciding binary genetic encodability

FOGA'05 Proceedings of the 8th international conference on Foundations of Genetic Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Holland's schema theorem (an inequality) may be viewed as an attempt to understand genetic search in terms of a coarse graining of the state space. Stephens and Waelbroeck developed that perspective, sharpening the schema theorem to an equality. Of particular interest is a "form invariance" of their equations; the form is unchanged by the degree of coarse graining. This paper establishes a similar form invariance for the more general model of Vose et al. and uses the attendant machinery as a springboard for an interpretation and discussion of implicit parallelism.