Sciweavers

269 search results - page 2 / 54
» Computing with Probabilistic Cellular Automata
Sort
View
BCS
2008
13 years 6 months ago
Dynamic Neighbourhood Cellular Automata
We propose a defi nition of Cellular Automaton in which links between cells can change during the computation. This is done locally by each cell, which can reach the neighbours of...
Stefan S. Dantchev
JCSS
2008
90views more  JCSS 2008»
13 years 4 months ago
Fault tolerance in cellular automata at high fault rates
A commonly used model for fault-tolerant computation is that of cellular automata. The essential difficulty of fault-tolerant computation is present in the special case of simply ...
Mark McCann, Nicholas Pippenger
MFCS
2004
Springer
13 years 10 months ago
Simulating 3D Cellular Automata with 2D Cellular Automata
The purpose of this article is to describe a way to simulate any 3-dimensional cellular automaton with a 2-dimensional cellular automaton. We will present the problems that arise w...
Victor Poupet
CORR
2010
Springer
79views Education» more  CORR 2010»
13 years 1 months ago
Probabilistic cellular automata, invariant measures, and perfect sampling
In a probabilistic cellular automaton (PCA), the cells are updated synchronously and independently, according to a distribution depending on a finite neighborhood. A PCA can be vi...
Ana Busic, Jean Mairesse, Irene Marcovici
IPPS
2003
IEEE
13 years 10 months ago
Secret Key Cryptography with Cellular Automata
The paper presents new results concerning application of cellular automata (CAs) to the secret key cryptography
Franciszek Seredynski, Pascal Bouvry, Albert Y. Zo...