We study an extension of cellular automata to arbitrary interconnection topologies for the ma jority 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.
Robustness of Evolved Small-World Automata Networks
GIACOBINI, Mario Dante Lucio;
2005-01-01
Abstract
We study an extension of cellular automata to arbitrary interconnection topologies for the ma jority 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.
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.
