620 search results - page 39 / 124 » Algorithms and computations on cellular automata |
180
click to vote
TCS
2010
15 years 1 months ago
2010
Uniform random generators deliver a simple empirical means to estimate the average complexity of an algorithm. We present a general rejection algorithm that generates sequential l...
149
click to vote
WIA
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. In 6], G. Myers describes a bit-vector algorithm to compute the edit distance between strings. The algorithm converts an input sequence to an output sequence in a paralle...
138
click to vote
SPAA
2006
ACM
16 years 6 days ago
2006
ACM
We introduce a simple new model of distributed computation — finite-state symmetric graph automata (FSSGA) — which captures the qualitative properties common to fault-toleran...
132
click to vote
PUC
2002
15 years 6 months ago
2002
Computer science algorithms can be used to improve user interfaces. Using data structures as a source of design ideas, a new interface was constructed for a cellular telephone han...
158
click to vote
IPPS
2006
IEEE
16 years 9 days ago
2006
IEEE
The GCA (Global Cellular Automata) model consists of a collection of cells which change their states synchronously depending on the states of their neighbors like in the classical...