Sciweavers

269 search results - page 19 / 54
» Computing with Probabilistic Cellular Automata
Sort
View
STACS
1997
Springer
14 years 24 days ago
Intrinsic Universality of a 1-Dimensional Reversible Cellular Automaton
Abstract. This paper deals with simulation and reversibility in the context of Cellular Automata (ca). We recall the de nitions of ca and of the Block (bca) and Partitioned (pca) s...
Jérôme Olivier Durand-Lose
IPPS
2006
IEEE
14 years 2 months ago
On-chip and on-line self-reconfigurable adaptable platform: the non-uniform cellular automata case
In spite of the high parallelism exhibited by cellular automata architectures, most implementations are usually run in software. For increasing execution parallelism, hardware imp...
Andres Upegui, Eduardo Sanchez
STACS
2010
Springer
14 years 3 months ago
Ultimate Traces of Cellular Automata
A cellular automaton (CA) is a parallel synchronous computing model, which consists in a juxtaposition of finite automata (cells) whose state evolves according to that of their ne...
Julien Cervelle, Enrico Formenti, Pierre Guillon
UPP
2004
Springer
14 years 2 months ago
Inverse Design of Cellular Automata by Genetic Algorithms: An Unconventional Programming Paradigm
Evolving solutions rather than computing them certainly represents an unconventional programming approach. The general methodology of evolutionary computation has already been know...
Thomas Bäck, Ron Breukelaar, Lars Willmes
UC
2005
Springer
14 years 2 months ago
On Reversible Cellular Automata with Finite Cell Array
Shuichi Inokuchi, Kazumasa Honda, Hyen Yeal Lee, T...