Studying Parallel Evolutionary Algorithms: The cellular Programming Case

Capcarrere, Mathieu S. and Tettamanzi, Andrea and Tomassini, Marco and Sipper, Moshe (1998) Studying Parallel Evolutionary Algorithms: The cellular Programming Case. In: Parallel Problem Solving from Nature V. (Full text available)

Download (245kB)
Official URL


Parallel evolutionary algorithms, studied to some extent over the past few years, have proven empirically worthwhile—though there seems to be lacking a better understanding of their workings. In this paper we concentrate on cellular (fine-grained) models, presenting a number of statistical measures, both at the genotypic and phenotypic levels. We demonstrate the application and utility of these measures on a specific example, that of the cellular programming evolutionary algorithm, when used to evolve solutions to a hard problem in the cellular-automata domain, known as synchronization.

Item Type: Conference or workshop item (UNSPECIFIED)
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Applied and Interdisciplinary Informatics Group
Depositing User: Mark Wheadon
Date Deposited: 25 Aug 2009 16:11
Last Modified: 12 Jun 2014 08:20
Resource URI: (The current URI for this page, for reference purposes)
  • Depositors only (login required):


Downloads per month over past year