269 search results - page 27 / 54 » Computing with Probabilistic Cellular Automata |
107
click to vote
ACRI
2010
Springer
15 years 24 days ago
2010
Springer
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...
132
click to vote
NABIC
2010
14 years 6 months ago
2010
A new design method for Cellular automata (CA) rules are described. We have already proposed a method for designing the transition rules of two-dimensional 256-state CA for graysca...
115
click to vote
HISB
2011
13 years 11 months ago
2011
— This paper presents a new cellular automata-based unsupervised image segmentation technique that is motivated by the interactive grow-cut algorithm. In contrast to the traditio...
ACRI
2004
Springer
15 years 3 months ago
2004
Springer
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 ...
ISMB
1996
15 years 17 days ago
1996