Sciweavers

269 search results - page 37 / 54
» Computing with Probabilistic Cellular Automata
Sort
View
CSR
2008
Springer
13 years 10 months ago
The Most General Conservation Law for a Cellular Automaton
Abstract. We study the group-valued and semigroup-valued conservation laws in cellular automata (CA). We provide examples to distinguish between semigroup-valued, group-valued and ...
Enrico Formenti, Jarkko Kari, Siamak Taati
CONCUR
2009
Springer
14 years 3 months ago
Weighted Bisimulation in Linear Algebraic Form
Abstract. We study bisimulation and minimization for weighted automata, relying on a geometrical representation of the model, linear weighted automata (lwa). In a lwa, the state-sp...
Michele Boreale
JPDC
2011
155views more  JPDC 2011»
12 years 11 months ago
A cellular learning automata-based deployment strategy for mobile wireless sensor networks
: One important problem which may arise in designing a deployment strategy for a wireless sensor network is how to deploy a specific number of sensor nodes throughout an unknown ne...
Mehdi Esnaashari, Mohammad Reza Meybodi
CMSB
2011
Springer
12 years 8 months ago
The singular power of the environment on stochastic nonlinear threshold Boolean automata networks
Abstract. This paper tackles theoretically the question of the structural stability of biological regulation networks subjected to the influence of their environment. The model of...
Jacques Demongeot, Sylvain Sené
ACRI
2008
Springer
14 years 3 months ago
On the Representation of Gliders in Rule 54 by De Bruijn and Cycle Diagrams
Abstract. Rule 54, in Wolfram’s notation, is one of elementary yet complexly behaving one-dimensional cellular automata. The automaton supports gliders, glider guns and other non...
Genaro Juárez Martínez, Andrew Adama...