Designing cellular automata using a parallel evolutionary algorithm

Moshe Sipper; Marco Tomassini; Mathieu S. Capcarrere

doi:10.1016/S0168-9002(97)89460-0

Designing cellular automata using a parallel evolutionary algorithm

Moshe Sipper, Marco Tomassini, Mathieu S. Capcarrere

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

Abstract

We have previously shown that non-uniform Cellular Automata (CA) can be evolved to perform computational tasks, using the cellular programming evolutionary algorithm. In this paper we focus on two novel issues, namely the evolution of asynchronous CAs, and the fault tolerance of our evolved systems. We find that asynchrony presents a more difficult case for evolution though good CAs can still be attained. We show that our evolved systems exhibit graceful degradation in performance, able to tolerate a certain level of faults. Our motivation for this study stems in part by our desire to attain realistic systems that are more amenable to implementation as 'evolving ware', evolware.

Original language	English
Pages (from-to)	278-283
Number of pages	6
Journal	Nuclear Instruments and Methods in Physics Research, Section A: Accelerators, Spectrometers, Detectors and Associated Equipment
Volume	389
Issue number	1-2
DOIs	https://doi.org/10.1016/S0168-9002(97)89460-0
State	Published - 11 Apr 1997
Externally published	Yes

Keywords

Asynchronous cellular automata
Cellular programming
Evolutionary computation
Evolware
Fault tolerance
Non-uniform cellular automata

ASJC Scopus subject areas

Nuclear and High Energy Physics
Instrumentation

Access to Document

10.1016/S0168-9002(97)89460-0

Cite this

@article{f568d86c4747438eb510d47c29564dd9,

title = "Designing cellular automata using a parallel evolutionary algorithm",

abstract = "We have previously shown that non-uniform Cellular Automata (CA) can be evolved to perform computational tasks, using the cellular programming evolutionary algorithm. In this paper we focus on two novel issues, namely the evolution of asynchronous CAs, and the fault tolerance of our evolved systems. We find that asynchrony presents a more difficult case for evolution though good CAs can still be attained. We show that our evolved systems exhibit graceful degradation in performance, able to tolerate a certain level of faults. Our motivation for this study stems in part by our desire to attain realistic systems that are more amenable to implementation as 'evolving ware', evolware.",

keywords = "Asynchronous cellular automata, Cellular programming, Evolutionary computation, Evolware, Fault tolerance, Non-uniform cellular automata",

author = "Moshe Sipper and Marco Tomassini and Capcarrere, {Mathieu S.}",

year = "1997",

month = apr,

day = "11",

doi = "10.1016/S0168-9002(97)89460-0",

language = "English",

volume = "389",

pages = "278--283",

journal = "Nuclear Instruments and Methods in Physics Research, Section A: Accelerators, Spectrometers, Detectors and Associated Equipment",

issn = "0168-9002",

publisher = "Elsevier B.V.",

number = "1-2",

}

Designing cellular automata using a parallel evolutionary algorithm. / Sipper, Moshe; Tomassini, Marco; Capcarrere, Mathieu S.
In: Nuclear Instruments and Methods in Physics Research, Section A: Accelerators, Spectrometers, Detectors and Associated Equipment, Vol. 389, No. 1-2, 11.04.1997, p. 278-283.

Research output: Contribution to journal › Article › peer-review

TY - JOUR

T1 - Designing cellular automata using a parallel evolutionary algorithm

AU - Sipper, Moshe

AU - Tomassini, Marco

AU - Capcarrere, Mathieu S.

PY - 1997/4/11

Y1 - 1997/4/11

N2 - We have previously shown that non-uniform Cellular Automata (CA) can be evolved to perform computational tasks, using the cellular programming evolutionary algorithm. In this paper we focus on two novel issues, namely the evolution of asynchronous CAs, and the fault tolerance of our evolved systems. We find that asynchrony presents a more difficult case for evolution though good CAs can still be attained. We show that our evolved systems exhibit graceful degradation in performance, able to tolerate a certain level of faults. Our motivation for this study stems in part by our desire to attain realistic systems that are more amenable to implementation as 'evolving ware', evolware.

AB - We have previously shown that non-uniform Cellular Automata (CA) can be evolved to perform computational tasks, using the cellular programming evolutionary algorithm. In this paper we focus on two novel issues, namely the evolution of asynchronous CAs, and the fault tolerance of our evolved systems. We find that asynchrony presents a more difficult case for evolution though good CAs can still be attained. We show that our evolved systems exhibit graceful degradation in performance, able to tolerate a certain level of faults. Our motivation for this study stems in part by our desire to attain realistic systems that are more amenable to implementation as 'evolving ware', evolware.

KW - Asynchronous cellular automata

KW - Cellular programming

KW - Evolutionary computation

KW - Evolware

KW - Fault tolerance

KW - Non-uniform cellular automata

UR - http://www.scopus.com/inward/record.url?scp=0031124437&partnerID=8YFLogxK

U2 - 10.1016/S0168-9002(97)89460-0

DO - 10.1016/S0168-9002(97)89460-0

M3 - Article

AN - SCOPUS:0031124437

SN - 0168-9002

VL - 389

SP - 278

EP - 283

JO - Nuclear Instruments and Methods in Physics Research, Section A: Accelerators, Spectrometers, Detectors and Associated Equipment

JF - Nuclear Instruments and Methods in Physics Research, Section A: Accelerators, Spectrometers, Detectors and Associated Equipment

IS - 1-2

ER -

Designing cellular automata using a parallel evolutionary algorithm

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this