Sciweavers

620 search results - page 31 / 124
» Algorithms and computations on cellular automata
Sort
View
ACRI
2010
Springer
15 years 7 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
ACRI
2004
Springer
15 years 10 months ago
Characterizing Configuration Spaces of Simple Threshold Cellular Automata
We study herewith the simple threshold cellular automata (CA), as perhaps the simplest broad class of CA with non-additive (i.e., non-linear and non-affine) local update rules. We ...
Predrag T. Tosic, Gul Agha
MCU
1998
170views Hardware» more  MCU 1998»
15 years 7 months ago
About the Universality of the Billiard ball model
Block cellular automata (BCA) make local, parallel, synchronous and uniform updates of in nite lattices. In the one-dimensionalcase, there exist BCA with 11 states which are unive...
Jérôme Olivier Durand-Lose
GPEM
2007
116views more  GPEM 2007»
15 years 6 months ago
Using evolvable genetic cellular automata to model breast cancer
Cancer is an evolutionary process; mutated cells are selected for abnormal growth and survivability. Here, a computer simulation is used to model ductal carcinoma in situ (DCIS), ...
Armand Bankhead, Robert B. Heckendorn
TCS
2011
15 years 1 months ago
Four states are enough!
This paper presents a 1D intrinsically universal cellular automaton with four states for a first neighbors neighborhood, improving on the previous lower bound and getting nearer ...
Nicolas Ollinger, Gaétan Richard