We study an extension of cellular automata to arbitrary interconnection topologies for the majority problem. By using an evolutionary algorithm, we show that small-world network topologies consistently evolve from regular and random structures without being designed beforehand. These topologies have better performance than regular lattice structures and are easier to evolve. Moreover they show high robustness to random faults.

A New Fault-Tolerance Measure for Evolved Small-World Automata Networks

GIACOBINI, Mario Dante Lucio;
2006

Abstract

We study an extension of cellular automata to arbitrary interconnection topologies for the majority problem. By using an evolutionary algorithm, we show that small-world network topologies consistently evolve from regular and random structures without being designed beforehand. These topologies have better performance than regular lattice structures and are easier to evolve. Moreover they show high robustness to random faults.
Seconda Giornata di Studio Italiana sul Calcolo Evoluzionistico, GSCICE 2006
Siena, Italy
September 2006
Atti della Seconda Giornata di Studio Italiana sul Calcolo Evoluzionistico
Cagnoni S.
-
-
9788890091001
evolutionary computation; robustness; cellular automata; irregular graph; small world
DARABOS CH; GIACOBINI M; TOMASSINI M
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/2318/27715
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact