Sciweavers

1035 search results - page 4 / 207
» Communications in cellular automata
Sort
View
IANDC
2008
139views more  IANDC 2008»
13 years 7 months ago
Computational complexity of dynamical systems: The case of cellular automata
Abstract. Cellular Automata can be considered discrete dynamical systems and at the same time a model of parallel computation. In this paper we investigate the connections between ...
Pietro di Lena, Luciano Margara
ACRI
2010
Springer
13 years 9 months ago
Network Decontamination with Temporal Immunity by Cellular Automata
Abstract. Network decontamination (or disinfection) is a widely studied problem in distributed computing. Network sites are assumed to be contaminated (e.g., by a virus) and a team...
Yassine Daadaa, Paola Flocchini, Nejib Zaguia
RAS
2006
86views more  RAS 2006»
13 years 7 months ago
Using cellular automata and gradients to control self-reconfiguration
Self-reconfigurable robots are built from modules, which are autonomously able to change the way they are connected. Such a robot can, through this self-reconfiguration process, c...
Kasper Støy
JAC
2008
13 years 9 months ago
Universalities in cellular automata a (short) survey
This reading guide aims to provide the reader with an easy access to the study of universality in the field of cellular automata. To fulfill this goal, the approach taken here is o...
Nicolas Ollinger
SASO
2008
IEEE
14 years 2 months ago
Integer Gradient for Cellular Automata: Principle and Examples
—When programming a spatial computing medium such as a cellular automaton, the hop count distance to some set of sources (particles) is an often used information. In particular, ...
Luidnel Maignan, Frédéric Gruau