Results 1  10
of
21,620
Cellular Automata
"... This paper deals with one approach designing complex biomorphical shapes by means of the evolutional processes, which are represented by the cellular automata with different types of cells. The paper describes a method for the definition the grammar and simulation of cellular array (transformation f ..."
Abstract
 Add to MetaCart
This paper deals with one approach designing complex biomorphical shapes by means of the evolutional processes, which are represented by the cellular automata with different types of cells. The paper describes a method for the definition the grammar and simulation of cellular array (transformation
Cellular Automata
"... A novel algorithm for performing parallel, distributed computer simulations on the Internet using IP control messages is introduced. The algorithm employs carefully constructed ICMP packets which enable the required computations to be completed as part of the standard IP communication protocol. Afte ..."
Abstract
 Add to MetaCart
. After providing a detailed description of the algorithm, experimental applications in the areas of stochastic neural networks and deterministic cellular automata are discussed. As an example of the algorithms potential power, a simulation of a deterministic cellular automaton involving Internet
cellular automata
, 2010
"... Abstract This paper presents a generalpurpose simulation approach integrating a set of technological developments and algorithmic methods in cellular automata (CA) domain. The approach provides a generalpurpose computing on graphics processor units (GPGPU) implementation for computing and multi ..."
Abstract
 Add to MetaCart
Abstract This paper presents a generalpurpose simulation approach integrating a set of technological developments and algorithmic methods in cellular automata (CA) domain. The approach provides a generalpurpose computing on graphics processor units (GPGPU) implementation for computing
cellular automata and Fischer automata
 Parallel Computing
, 1997
"... We study the sizes of minimal finite state machines associated with linear cellular automata. In particular, we construct a class of binary linear cellular automata whose corresponding minimal automata exhibit full exponential blowup. These cellular automata have Hamming distance 1 to a permutatio ..."
Abstract

Cited by 15 (9 self)
 Add to MetaCart
We study the sizes of minimal finite state machines associated with linear cellular automata. In particular, we construct a class of binary linear cellular automata whose corresponding minimal automata exhibit full exponential blowup. These cellular automata have Hamming distance 1 to a
cellular automata and
"... edge detection via image statistic features and hybrid model of fuzzy ..."
Algebraic Properties of Cellular Automata
, 1984
"... This paper details and extends the discussion of global proper72 L a T E X filename: Algebraic.tex (Paper: 1.2 [2]) 12:08 p.m. October 20, 1993 Algebraic Properties of Cellular Automata (1984) Figure 2. Global state transition diagrams for finite cellular automata with size N and periodic boundary c ..."
Abstract

Cited by 82 (1 self)
 Add to MetaCart
This paper details and extends the discussion of global proper72 L a T E X filename: Algebraic.tex (Paper: 1.2 [2]) 12:08 p.m. October 20, 1993 Algebraic Properties of Cellular Automata (1984) Figure 2. Global state transition diagrams for finite cellular automata with size N and periodic boundary
CELLULAR AUTOMATA
, 2008
"... In this lecture I shall present a class of mathematical tools for modeling phenomena that can be described in terms of elementary interacting objects. The goal is to make the macroscopic behavior arise from individual dynamics. I shall ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
In this lecture I shall present a class of mathematical tools for modeling phenomena that can be described in terms of elementary interacting objects. The goal is to make the macroscopic behavior arise from individual dynamics. I shall
Cellular Automata
"... tion scheme (neighborhood does or does not remain fixed in time). Some of the names associated with one or more of these versions are cellular automaton, cellular space, tessellation automaton, modular array, iterative automaton, intelligent graph, Lindenmayer system, and cellular network. The firs ..."
Abstract
 Add to MetaCart
tion scheme (neighborhood does or does not remain fixed in time). Some of the names associated with one or more of these versions are cellular automaton, cellular space, tessellation automaton, modular array, iterative automaton, intelligent graph, Lindenmayer system, and cellular network
Cellular Automata
"... are discrete physicslike systems that can be exactly simulated by digital hardware. These systems can incorporate many realistic physical constraints and still be capable of performing digital computation. Such systems bridge the boundary between physical models and computational models, and so can ..."
Abstract
 Add to MetaCart
are discrete physicslike systems that can be exactly simulated by digital hardware. These systems can incorporate many realistic physical constraints and still be capable of performing digital computation. Such systems bridge the boundary between physical models and computational models, and so can play a central role in investigating the relevance of physical ideas to the theory and practice of computation, and computational ideas to the construction and use of physical models. 1
Cellular Automata
, 2010
"... The model presented here is an attempt to bridge a widening gap between theoretical and empirical models of urban growth. It explores a specific theoretical assumption regarding the spatial determinants of land use patterns grounded in detailed empirical data which document the historical growth of ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The model presented here is an attempt to bridge a widening gap between theoretical and empirical models of urban growth. It explores a specific theoretical assumption regarding the spatial determinants of land use patterns grounded in detailed empirical data which document the historical growth of West London at an unusually high levelofspatialandtemporal resolution. The results of the study provide support for a radical hypothesis which states that: 1) the spatial relationships between land uses and the physical environment are remarkably consistent through time, showing little variation relative to changes in historical context; and 2) that these relationships constitute a basic genetic code of urban growth which determines the spatial signature of land development in a given metropolitan area.
Results 1  10
of
21,620