269 search results - page 22 / 54 » Computing with Probabilistic Cellular Automata |
CIT
2006
Springer
14 years 11 days ago
2006
Springer
CA are useful tools in modeling and simulation. However, the more complex a CA is, the longer it takes to run in typical environments. A dedicated CA machine solves this problem by...
TCS
2011
13 years 3 months ago
2011
Let F be a cellular automaton (CA). This paper establishes necessary conditions for F in order to be intrinsically universal. The central idea is to consider the communication com...
MFCS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Cellular automata (CA) are discrete, homogeneous dynamical systems. Non-surjective one-dimensional CA have nite words with no preimage (called orphans), pairs of dieren...
PACT
1999
Springer
14 years 27 days ago
1999
Springer
We introduce a new model for objects which can move around on a cellular grid. The model consists of two phases, the movement phase and the con ict resolution phase. In the movemen...
PVM
2005
Springer
14 years 2 months ago
2005
Springer
Parallel execution of simulation runs has become indispensable in different research areas recently. One of the most promising and powerful models in science are cellular automata ...