500 search results - page 15 / 100 » Universality and Cellular Automata |
120
click to vote
FCT
2005
Springer
15 years 9 months ago
2005
Springer
We show that a slightly extended version of asynchronous cellular automata, relative to any class of pomsets and dags without autoconcurrency, has the same expressive power as the ...
159
click to vote
HIS
2004
15 years 5 months ago
2004
In this paper, a new fuzzy clustering algorithm that uses cellular learning automata based evolutionary computing (CLA-EC) is proposed. The CLA-EC is a model obtained by combining...
119
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We define a new transfinite time model of computation, infinite time cellular automata. The model is shown to be as powerful than infinite time Turing machines, both on finite and ...
127
click to vote
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
A non-uniform cellular automata-based model is presented for the evolutionary development of digital circuits at the gate level. The main feature of this model is the modified lo...
113
click to vote
ACRI
2006
Springer
15 years 7 months ago
2006
Springer
This paper describes a model of three-dimensional cellular automata allowing to simulate different phenomena in the fields of computer graphics or image processing. Our method allo...