Coarse-Graining in Genetic Algorithms: Some Issues and Examples

13 years 9 months ago

Download www.cs.york.ac.uk

Following the work of Stephens and coworkers on the coarse-grained dynamics of genetic systems, we work towards a possible generalisation in the context of genetic algorithms, giving as examples schemata, genotype-phenotype mappings, and error classes in the Eigen model. We discuss how the dynamics transforms under a coarse-graining, comparing and contrasting different notions of invariance. We work out some examples in the two-bit case, to illustrate the ideas and issues. We then ﬁnd a bound for the Selection Weighted Linkage Disequilibrium Coefﬁcient for the two-bit onemax problem.

Andrés Aguilar Contreras, Jonathan E. Rowe,

Real-time Traffic

Coarse-grained Dynamics | GECCO 2003 | Linkage Disequilibrium Coefﬁcient | Two-bit Onemax Problem |

claim paper

» A TopicBased Measure of Resource Description Quality for Distributed Information Retrieval

» Hardware synthesis from coarsegrained dataflow specification for fast HWSW cosynthesis

» Some Issues on the Implementation of Local Search in Evolutionary Multiobjective Optimizat...

» A hybrid approach to parameter tuning in genetic algorithms

» Shape Modeling from Multiple View Images Using GAs

» Tackling RealCoded Genetic Algorithms Operators and Tools for Behavioural Analysis

» Map Segmentation by Colour Cube Genetic KMean Clustering

» Machine Translation Method Using Inductive Learning with Genetic Algorithms

Post Info
More Details (n/a)

Added	06 Jul 2010
Updated	06 Jul 2010
Type	Conference
Year	2003
Where	GECCO
Authors	Andrés Aguilar Contreras, Jonathan E. Rowe, Christopher R. Stephens

Comments (0)

Sciweavers

Coarse-Graining in Genetic Algorithms: Some Issues and Examples

Coarse-grained Dynamics | GECCO 2003 | Linkage Disequilibrium Coefﬁcient | Two-bit Onemax Problem |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers