47 search results - page 4 / 10 » Changing the Neighborhood of Cellular Automata |
ACRI
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Network decontamination (or disinfection) is a widely studied problem in distributed computing. Network sites are assumed to be contaminated (e.g., by a virus) and a team...
IV
2007
IEEE
14 years 1 months ago
2007
IEEE
We propose a method for generating all possible rules of multidimension Boolean cellular automata (CA). Based on an original encoding method and the programming of graphical proce...
IJBC
2006
13 years 7 months ago
2006
We study a binary-cell-states eight-cell neighborhood two-dimensional cellular automaton model of a quasi-chemical system with a substrate and a reagent. Reactions are represented...
ACRI
2006
Springer
14 years 1 months ago
2006
Springer
Two-dimensional cellular automata (CA) systems are widely used for modeling spatio-temporal dynamics of evolving populations. Conversely, the logistic equation is a 1-D model descr...
ACRI
2004
Springer
14 years 26 days 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...