Results 21 to 30 of about 43,712 (268)
Dynamic Path Planning for Mobile Robots with Cellular Learning Automata
In this paper we propose a new approach to path planning for mobile robots with cellular automata and cellular learning automata. We divide the planning into two stages.
Judhi Santoso+2 more
doaj +1 more source
The structure of communication problems in cellular automata [PDF]
Studying cellular automata with methods from communication complexity appears to be a promising approach. In the past, interesting connections between communication complexity and intrinsic universality in cellular automata were shown.
Raimundo Briceño+1 more
doaj +1 more source
This paper develops the analysis of properties of the cellular automata class introduced by the authors. It is assumed that the set of automaton cells is finite and forms a closed lattice, and there are two states for each automaton cell.
Valery Kozlov+2 more
doaj +1 more source
Predictability in cellular automata. [PDF]
Modelled as finite homogeneous Markov chains, probabilistic cellular automata with local transition probabilities in (0, 1) always posses a stationary distribution. This result alone is not very helpful when it comes to predicting the final configuration;
Alexandru Agapie+3 more
doaj +1 more source
Plasmonic Nanostructured Cellular Automata
In this work, we have investigated the scattering plasmonic resonance characteristics of silver nanospheres with a geometrical distribution that is modelled by Cellular Automata using time-domain numerical analysis.
Alkhazraji Emad+3 more
doaj +1 more source
Cellular Automata are Generic [PDF]
Any algorithm (in the sense of Gurevich's abstract-state-machine axiomatization of classical algorithms) operating over any arbitrary unordered domain can be simulated by a dynamic cellular automaton, that is, by a pattern-directed cellular automaton ...
Nachum Dershowitz, Evgenia Falkovich
doaj +1 more source
A Linear Acceleration Theorem for 2D Cellular Automata on all Complete Neighborhoods [PDF]
Linear acceleration theorems are known for most computational models. Although such results have been proved for two-dimensional cellular automata working on specific neighborhoods, no general construction was known. We present here a technique of linear acceleration for all two-dimensional languages recognized by cellular automata working on complete ...
arxiv +1 more source
Block cipher based on T-shaped cellular automata
In order to overcome the defect on insecurity of block cipher with few reversible cellular automata, T-shaped cellular automata was proposed, which needed two initial states and applied their characteristics to construct more re-versible cellular ...
WU Ying-zhi1, HAO Li-bo2, CHEN Ju-hua1
doaj +2 more sources
«Life» in Tensor: Implementing Cellular Automata on Graphics Adapters
This paper presents an approach to the description of cellular automata using tensors. This approach allows to attract various frameworks for organizing scientific calculations on high-performance graphics adapter processors, that is, to automatically ...
Natalia Andreevna Shalyapina+1 more
doaj +1 more source
Communications in cellular automata [PDF]
The goal of this paper is to show why the framework of communication complexity seems suitable for the study of cellular automata. Researchers have tackled different algorithmic problems ranging from the complexity of predicting to the decidability of ...
Guillaume Theyssier+3 more
doaj +1 more source