620 search results - page 32 / 124 » Algorithms and computations on cellular automata |
119
Voted
FGCS
2007
15 years 14 days ago
2007
In this paper we present CAMELotGrid, a tool to manage Grid computations of Cellular Automata that support the efficient simulation of complex systems modeled by a very large numb...
98
Voted
WCE
2007
15 years 1 months ago
2007
— We present in this paper a generic methodology based on genetic automata for modelling community detection. With Communities, we deal with dynamic organizations which are self-...
84
Voted
FUIN
2002
15 years 8 days ago
2002
One-way and two-way cellular language acceptors with restricted nondeterminism are investigated. The number of nondeterministic state transitions is regarded as limited resource wh...
88
Voted
STACS
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We prove that, for any arbitrary finite alphabet and for the uniform distribution over deterministic and accessible automata with n states, the average complexity of Moo...
91
Voted
WADS
2007
Springer
15 years 6 months ago
2007
Springer
In the maximum sharing problem (MS), we want to compute a set of (non-simple) paths in an undirected bipartite graph covering as many nodes as possible of the first layer of the ...