Sciweavers

217 search results - page 1 / 44
» Computational complexity of dynamical systems: The case of c...
Sort
View
IANDC
2008
139views more  IANDC 2008»
13 years 4 months ago
Computational complexity of dynamical systems: The case of cellular automata
Abstract. Cellular Automata can be considered discrete dynamical systems and at the same time a model of parallel computation. In this paper we investigate the connections between ...
Pietro di Lena, Luciano Margara
COMPLEXITY
2010
108views more  COMPLEXITY 2010»
13 years 2 months ago
How to make dull cellular automata complex by adding memory: Rule 126 case study
Using Rule 126 elementary cellular automaton (ECA) we demonstrate that a chaotic discrete system -- when enriched with memory
Genaro Juárez Martínez, Andrew Adama...
ICIAP
1999
ACM
13 years 9 months ago
Cellular Automata Based Optical Flow Computation for "Just-in-Time" Applications
Real-world tasks often require real-time performances. However, in many practical cases, “just in time” responses are sufficient. This means that a system should be efficien...
Giovanni Adorni, Stefano Cagnoni, Monica Mordonini
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
ACRI
2006
Springer
13 years 8 months ago
Merging Cellular Automata for Simulating Surface Effects
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...
Stéphane Gobron, Denis Finck, Philippe Even...