620 search results - page 26 / 124 » Algorithms and computations on cellular automata |
82
Voted
ICCAD
2005
IEEE
15 years 9 months ago
2005
IEEE
— When exploring computing elements made from technologies other than CMOS, it is imperative to investigate the effects of physical implementation constraints. This paper focuses...
87
Voted
CIT
2006
Springer
15 years 4 months 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...
82
Voted
ACRI
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Genetic Algorithms have been used before to evolve transition rules for one dimensional Cellular Automata (CA) to solve e.g. the majority problem and investigate communic...
104
click to vote
VTS
1998
IEEE
15 years 4 months ago
1998
IEEE
This paper presents a BIST architecture for Finite State Machines that exploits Cellular Automata (CA) as pattern generators and signature analyzers. The main advantage of the pro...
126
Voted
TCS
2011
14 years 7 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...