Sciweavers

367 search results - page 39 / 74
» Captive Cellular Automata
Sort
View
CORR
2010
Springer
157views Education» more  CORR 2010»
13 years 7 months ago
Clandestine Simulations in Cellular Automata
This paper studies two kinds of simulation between cellular automata: simulations based on factor and simulations based on sub-automaton. We show that these two kinds of simulation...
Pierre Guillon, Pierre-Etienne Meunier, Guillaume ...
AAAI
2008
13 years 10 months ago
2-Dimensional Cellular Automata Approach for Robot Grid Formations
One potentially cost-effective approach to harvesting solar power from space is the use of thousands of individual robots moving in formation, each with a piece of solar panel att...
Ross Mead, Jerry B. Weinberg
GEOINFORMATICA
2006
86views more  GEOINFORMATICA 2006»
13 years 7 months ago
Decreasing Computational Time of Urban Cellular Automata Through Model Portability
This paper investigates how portability of a model between different computer operating systems can lead to increased efficiency in code execution. The portability problem is not a...
Charles Dietzel, Keith C. Clarke
SASO
2008
IEEE
14 years 2 months ago
Integer Gradient for Cellular Automata: Principle and Examples
—When programming a spatial computing medium such as a cellular automaton, the hop count distance to some set of sources (particles) is an often used information. In particular, ...
Luidnel Maignan, Frédéric Gruau
TCS
2011
13 years 2 months ago
Communication complexity and intrinsic universality in cellular automata
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...
Eric Goles Chacc, Pierre-Etienne Meunier, Ivan Rap...