Neutral Fitness Landscape in the Cellular Automata Majority Problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2006

Neutral Fitness Landscape in the Cellular Automata Majority Problem

Résumé

We study in detail the fitness landscape of a difficult cellular automata computational task: the majority problem. Our results show why this problem landscape is so hard to search, and we quantify the large degree of neutrality found in various ways. We show that a particular subspace of the solution space, called the "Olympus", is where good solutions concentrate, and give measures to quantitatively characterize this subspace.
Fichier principal
Vignette du fichier
neutral-fitness-land-CA-majProb.pdf (204.39 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00164673 , version 1 (28-03-2008)

Identifiants

Citer

Sébastien Verel, Philippe Collard, Marco Tomassini, Leonardo Vanneschi. Neutral Fitness Landscape in the Cellular Automata Majority Problem. 7th International Conference on Cellular Automata For Research and Industry - ACRI 2006, Sep 2006, France. pp.258-267. ⟨hal-00164673⟩
119 Consultations
152 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More