Sciweavers

47 search results - page 3 / 10
» Changing the Neighborhood of Cellular Automata
Sort
View
ICTAI
2005
IEEE
14 years 1 months ago
Cellular Ants: Combining Ant-Based Clustering with Cellular Automata
This paper proposes a novel data clustering algorithm, coined ‘cellular ants’, which combines principles of cellular automata and ant colony optimization algorithms to group s...
Andrew Vande Moere, Justin James Clayden
TCS
2011
13 years 2 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
SIAMCOMP
2002
153views more  SIAMCOMP 2002»
13 years 7 months ago
A Decision Procedure for Unitary Linear Quantum Cellular Automata
Linear quantum cellular automata were introduced recently as one of the models of quantum computing. A basic postulate of quantum mechanics imposes a strong constraint on any quan...
Christoph Dürr, Miklos Santha
CORR
2010
Springer
79views Education» more  CORR 2010»
13 years 4 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
JAC
2008
13 years 9 months ago
Rule 110: universality and catenations
Cellular automata are a simple model of parallel computation. Many people wonder about the computing power of such a model. Following an idea of S. Wolfram [16], M. Cook [3] has pr...
Gaétan Richard