Relevant bibliographies by topics / Cellular automata

Academic literature on the topic 'Cellular automata'

Author: Grafiati
Published: 4 June 2021
Last updated: 1 August 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Cellular automata.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Cellular automata"

1

BOCCARA, NINO. "RANDOMIZED CELLULAR AUTOMATA." International Journal of Modern Physics C 18, no. 08 (August 2007): 1303–12. http://dx.doi.org/10.1142/s0129183107011339.

Full text
Abstract:
We define and study a few properties of a class of random automata networks. While regular finite one-dimensional cellular automata are defined on periodic lattices, these automata networks, called randomized cellular automata, are defined on random directed graphs with constant out-degrees and evolve according to cellular automaton rules. For some families of rules, a few typical a priori unexpected results are presented.
APA, Harvard, Vancouver, ISO, and other styles
2

Mardiris, Vassilios A., Georgios Ch Sirakoulis, and Ioannis G. Karafyllidis. "Automated Design Architecture for 1-D Cellular Automata Using Quantum Cellular Automata." IEEE Transactions on Computers 64, no. 9 (September 1, 2015): 2476–89. http://dx.doi.org/10.1109/tc.2014.2366745.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kari, Jarkko, Ville Salo, and Thomas Worsch. "Sequentializing cellular automata." Natural Computing 19, no. 4 (June 1, 2019): 759–72. http://dx.doi.org/10.1007/s11047-019-09745-7.

Full text
Abstract:
Abstract We study the problem of sequentializing a cellular automaton without introducing any intermediate states, and only performing reversible permutations on the tape. We give a decidable characterization of cellular automata which can be written as a single sweep of a bijective rule from left to right over an infinite tape. Such cellular automata are necessarily left-closing, and they move at least as much information to the left as they move information to the right.
APA, Harvard, Vancouver, ISO, and other styles
4

Jung, Goeun, and Youngho Kim. "Modeling of Spatio-temporal changes of Urban Sprawl in Jeju-island: Using CA (Cellular Automata) and ARD (Automatic Rule Detection)." Journal of the Association of Korean Geographers 10, no. 1 (April 30, 2021): 139–52. http://dx.doi.org/10.25202/jakg.10.1.9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

TORBEY, SAMI. "TOWARDS A FRAMEWORK FOR INTUITIVE PROGRAMMING OF CELLULAR AUTOMATA." Parallel Processing Letters 19, no. 01 (March 2009): 73–83. http://dx.doi.org/10.1142/s0129626409000079.

Full text
Abstract:
The ability to obtain complex global behaviour from simple local rules makes cellular automata an interesting platform for massively parallel computation. However, manually designing a cellular automaton to perform a given computation can be extremely difficult, and automated design techniques such as genetic programming have their limitations because of the absence of human intuition. In this paper, we propose elements of a framework whose goal is to make the manual synthesis of cellular automata rules exhibiting desired global characteristics more programmer-friendly, while maintaining the simplicity of local processing elements. Although many of the framework elements that we describe here are not new, we group them into a consistent framework and show that they can all be implemented on a traditional cellular automaton, which means that they are merely more human-friendly ways of describing simple cellular automata rules, and not foreign structures that require changing the traditional cellular automaton model.
APA, Harvard, Vancouver, ISO, and other styles
6

Hasanzadeh Mofrad, Mohammad, Sana Sadeghi, Alireza Rezvanian, and Mohammad Reza Meybodi. "Cellular edge detection: Combining cellular automata and cellular learning automata." AEU - International Journal of Electronics and Communications 69, no. 9 (September 2015): 1282–90. http://dx.doi.org/10.1016/j.aeue.2015.05.010.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

BEIGY, HAMID, and M. R. MEYBODI. "OPEN SYNCHRONOUS CELLULAR LEARNING AUTOMATA." Advances in Complex Systems 10, no. 04 (December 2007): 527–56. http://dx.doi.org/10.1142/s0219525907001264.

Full text
Abstract:
Cellular learning automata is a combination of learning automata and cellular automata. This model is superior to cellular learning automata because of its ability to learn and also is superior to single learning automaton because it is a collection of learning automata which can interact together. In some applications such as image processing, a type of cellular learning automata in which the action of each cell in the next stage of its evolution not only depends on the local environment (actions of its neighbors) but it also depends on the external environments. We call such a cellular learning automata as open cellular learning automata. In this paper, we introduce open cellular learning automata and then study its steady state behavior. It is shown that for a class of rules called commutative rules, the open cellular learning automata in stationary external environments converges to a stable and compatible configuration. Then the application of this new model to image segmentation has been presented.
APA, Harvard, Vancouver, ISO, and other styles
8

Bhardwaj, Rupali, and Anil Upadhyay. "Cellular Automata." Journal of Organizational and End User Computing 29, no. 1 (January 2017): 42–50. http://dx.doi.org/10.4018/joeuc.2017010103.

Full text
Abstract:
Cellular automata (CA) are discrete dynamical systems consist of a regular finite grid of cell; each cell encapsulating an equal portion of the state, and arranged spatially in a regular fashion to form an n-dimensional lattice. A cellular automata is like computers, data represented by initial configurations which is processed by time evolution to produce output. This paper is an empirical study of elementary cellular automata which includes concepts of rule equivalence, evolution of cellular automata and classification of cellular automata. In addition, explanation of behaviour of cellular automata is revealed through example.
APA, Harvard, Vancouver, ISO, and other styles
9

Bandini, S. "Cellular automata." Future Generation Computer Systems 18, no. 7 (August 2002): v—vi. http://dx.doi.org/10.1016/s0167-739x(02)00067-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Kutrib, Martin, Roland Vollmar, and Thomas Worsch. "Cellular automata." Parallel Computing 23, no. 11 (November 1997): 1565. http://dx.doi.org/10.1016/s0167-8191(97)82081-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Cellular automata"

1

Collins, Sean. "Interactive cellular automata." Thesis, Lancaster University, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.435877.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Epperlein, Jeremias. "Topological Conjugacies Between Cellular Automata." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2017. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-231823.

Full text
Abstract:
We study cellular automata as discrete dynamical systems and in particular investigate under which conditions two cellular automata are topologically conjugate. Based on work of McKinsey, Tarski, Pierce and Head we introduce derivative algebras to study the topological structure of sofic shifts in dimension one. This allows us to classify periodic cellular automata on sofic shifts up to topological conjugacy based on the structure of their periodic points. We also get new conjugacy invariants in the general case. Based on a construction by Hanf and Halmos, we construct a pair of non-homeomorphic subshifts whose disjoint sums with themselves are homeomorphic. From this we can construct two cellular automata on homeomorphic state spaces for which all points have minimal period two, which are, however, not topologically conjugate. We apply our methods to classify the 256 elementary cellular automata with radius one over the binary alphabet up to topological conjugacy. By means of linear algebra over the field with two elements and identities between Fibonacci-polynomials we show that every conjugacy between rule 90 and rule 150 cannot have only a finite number of local rules. Finally, we look at the sequences of finite dynamical systems obtained by restricting cellular automata to spatially periodic points. If these sequences are termwise conjugate, we call the cellular automata conjugate on all tori. We then study the invariants under this notion of isomorphism. By means of an appropriately defined entropy, we can show that surjectivity is such an invariant.
APA, Harvard, Vancouver, ISO, and other styles
3

Rakotomalala, Livaniaina Hary. "Network Decontamination Using Cellular Automata." Thesis, Université d'Ottawa / University of Ottawa, 2016. http://hdl.handle.net/10393/34095.

Full text
Abstract:
We consider the problem of decontaminating a network where all nodes are infected by a virus. The decontamination strategy is performed using a Cellular Automata (CA) model in which each node of the network is represented by the automata cell and thus, the network host status is also mapped to the CA state (contaminated, decontaminating, decontaminated). All hosts are assumed to be initially contaminated and the status of each cell is synchronously updated according to a set of local rules, based on the state of its neighbourhood. Our goal is to find the set of local rules that will accomplish the decontamination in an optimal way. The metrics used to define optimality is the minimization of three metrics: the maximum number of decontaminating cells at each step, the required value of the immunity time of each cell and the number of steps to complete the sanitization algorithm. In our research, we explore the designing of these local decontamination rules by refining the concept of the neighbourhood radius of CA with the addition of two new dimensions: Visibility Hop and Contamination Distance. Additionally, a research tool that help us manage our study have been developed.
APA, Harvard, Vancouver, ISO, and other styles
4

Weimar, Jorg Richard. "Cellular automata for reactive systems." Doctoral thesis, Universite Libre de Bruxelles, 1995. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/212557.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Deng, Mingyuan. "Programmable cellular automata for cryptosystems." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ39137.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Serquera, Jaime. "Sound synthesis with cellular automata." Thesis, University of Plymouth, 2012. http://hdl.handle.net/10026.1/1189.

Full text
Abstract:
This thesis reports on new music technology research which investigates the use of cellular automata (CA) for the digital synthesis of dynamic sounds. The research addresses the problem of the sound design limitations of synthesis techniques based on CA. These limitations fundamentally stem from the unpredictable and autonomous nature of these computational models. Therefore, the aim of this thesis is to develop a sound synthesis technique based on CA capable of allowing a sound design process. A critical analysis of previous research in this area will be presented in order to justify that this problem has not been previously solved. Also, it will be discussed why this problem is worthwhile to solve. In order to achieve such aim, a novel approach is proposed which considers the output of CA as digital signals and uses DSP procedures to analyse them. This approach opens a large variety of possibilities for better understanding the self-organization process of CA with a view to identifying not only mapping possibilities for making the synthesis of sounds possible, but also control possibilities which enable a sound design process. As a result of this approach, this thesis presents a technique called Histogram Mapping Synthesis (HMS), which is based on the statistical analysis of CA evolutions by histogram measurements. HMS will be studied with four different automatons, and a considerable number of control mechanisms will be presented. These will show that HMS enables a reasonable sound design process. With these control mechanisms it is possible to design and produce in a predictable and controllable manner a variety of timbres. Some of these timbres are imitations of sounds produced by acoustic means and others are novel. All the sounds obtained present dynamic features and many of them, including some of those that are novel, retain important characteristics of sounds produced by acoustic means.
APA, Harvard, Vancouver, ISO, and other styles
7

Powley, Edward Jack. "Global properties of cellular automata." Thesis, University of York, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.516655.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Clewlow, Les. "Cellular automata and dynamical systems." Thesis, University of Warwick, 1989. http://wrap.warwick.ac.uk/4233/.

Full text
Abstract:
In this thesis we investigate the theoretical nature of the mathematical structures termed cellular automata. Chapter 1: Reviews the origin and history of cellular automata in order to place the current work into context. Chapter 2: Develops a cellular automata framework which contains the main aspects of cellular automata structure which have appeared in the literature. We present a scheme for specifying the cellular automata rules for this general model and present six examples of cellular automata within the model. Chapter 3: Here we develop a statistical mechanical model of cellular automata behaviour. We consider the relationship between variations within the model and their relationship to dynamical systems. We obtain results on the variance of the state changes, scaling of the cellular automata lattice, the equivalence of noise, spatial mixing of the lattice states and entropy, synchronous and asynchronous cellular automata and the equivalence of the rule probability and the time step of a discrete approximation to a dynamical system. Chapter 4: This contains an empirical comparison of cellular automata within our general framework and the statistical mechanical model. We obtain results on the transition from limit cycle to limit point behaviour as the rule probabilities are decreased. We also discuss failures of the statistical mechanical model due to failure of the assumptions behind it. Chapter 5: Here a practical application of the preceding work to population genetics is presented. We study this in the context of some established population models and show it may be most useful in the field of epidemiology. Further generalisations of the statistical mechanical and cellular automata models allow the modelling of more complex population models and mobile populations of organisms. Chapter 6: Reviews the results obtained in the context of the open questions introduced in Chapter 1. We also consider further questions this work raises and make some general comments on how these may apply to related fields.
APA, Harvard, Vancouver, ISO, and other styles
9

Slotta, Douglas J. "Structural Design Using Cellular Automata." Thesis, Virginia Tech, 2001. http://hdl.handle.net/10919/33368.

Full text
Abstract:
Traditional parallel methods for structural design do not scale well. This thesis discusses the application of massively scalable cellular automata (CA) techniques to structural design. There are two sets of CA rules, one used to propagate stresses and strains, and one to perform design analysis. These rules can be applied serially, periodically, or concurrently, and Jacobi or Gauss-Seidel style updating can be done. These options are compared with respect to convergence, speed, and stability.
Master of Science
APA, Harvard, Vancouver, ISO, and other styles
10

Betel, Heather. "Properties and Behaviours of Fuzzy Cellular Automata." Thèse, Université d'Ottawa / University of Ottawa, 2012. http://hdl.handle.net/10393/22858.

Full text
Abstract:
Cellular automata are systems of interconnected cells which are discrete in space, time and state. Cell states are updated synchronously according to a local rule which is dependent upon the current state of the given cell and those of its neighbours in a pre-defined neighbourhood. The local rule is common to all cells. Fuzzy cellular automata extend this notion to systems which are discrete in space and time but not state. In this thesis, we explore fuzzy cellular automata which are created from the extension of Boolean rules in disjunctive normal form to continuous functions. Motivated by recent results on the classification of these rules from empirical evidence, we set out first to show that fuzzy cellular automata can shed some light on classical cellular automata and then to prove that the observed results are mathematically correct. The main results of this thesis can be divided into two categories. We first investigate the links between fuzzy cellular automata and their Boolean counter-parts. We prove that number conservation is preserved by this transformation. We further show that Boolean additive cellular automata have a definable property in their fuzzy form which we call self-oscillation. We then give a probabilistic interpretation of fuzzy cellular automata and show that homogeneous asymptotic states are equivalent to mean field approximations of Boolean cellular automata. We then turn our attention the asymptotic behaviour of fuzzy cellular automata. In the second half of the thesis we investigate the observed behaviours of the fuzzy cellular automata derived from balanced Boolean rules. We show that the empirical results of asymptotic behaviour are correct. In fuzzy form, the balanced rules can be categorized as one of three types: weighted average rules, self-averaging rules, and local majority rules. Each type is analyzed in a variety of ways using a range of tools to explain their behaviours.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Cellular automata"

1

Chopard, Bastien, Stefania Bandini, Alberto Dennunzio, and Mira Arabi Haddad, eds. Cellular Automata. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-14926-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Mauri, Giancarlo, Samira El Yacoubi, Alberto Dennunzio, Katsuhiro Nishinari, and Luca Manzoni, eds. Cellular Automata. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-99813-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Bandini, Stefania, Bastien Chopard, and Marco Tomassini, eds. Cellular Automata. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45830-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Sirakoulis, Georgios Ch, and Stefania Bandini, eds. Cellular Automata. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-33350-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Bandini, Stefania, Sara Manzoni, Hiroshi Umeo, and Giuseppe Vizzari, eds. Cellular Automata. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-15979-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

El Yacoubi, Samira, Jaroslaw Wąs, and Stefania Bandini, eds. Cellular Automata. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-44365-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Schiff, Joel L. Cellular Automata. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2007. http://dx.doi.org/10.1002/9781118032381.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Delorme, M., and J. Mazoyer, eds. Cellular Automata. Dordrecht: Springer Netherlands, 1999. http://dx.doi.org/10.1007/978-94-015-9153-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Umeo, Hiroshi, Shin Morishita, Katsuhiro Nishinari, Toshihiko Komatsuzaki, and Stefania Bandini, eds. Cellular Automata. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-79992-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Wąs, Jarosław, Georgios Ch Sirakoulis, and Stefania Bandini, eds. Cellular Automata. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-11520-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Cellular automata"

1

Formenti, Enrico, and Petr Kůrka. "Dynamics of Cellular Automata in Noncompact Spaces." In Cellular Automata, 323–35. New York, NY: Springer US, 2009. http://dx.doi.org/10.1007/978-1-4939-8700-9_138.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Cervelle, Julien, and Enrico Formenti. "Algorithmic Complexity and Cellular Automata." In Cellular Automata, 459–77. New York, NY: Springer US, 2009. http://dx.doi.org/10.1007/978-1-4939-8700-9_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Pivato, Marcus. "Ergodic Theory of Cellular Automata." In Cellular Automata, 373–418. New York, NY: Springer US, 2009. http://dx.doi.org/10.1007/978-1-4939-8700-9_178.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Cenek, Martin, and Melanie Mitchell. "Evolving Cellular Automata." In Cellular Automata, 543–54. New York, NY: Springer US, 2009. http://dx.doi.org/10.1007/978-1-4939-8700-9_191.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Umeo, Hiroshi. "Firing Squad Synchronization Problem in Cellular Automata." In Cellular Automata, 583–639. New York, NY: Springer US, 2018. http://dx.doi.org/10.1007/978-1-4939-8700-9_211.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Bays, Carter. "Gliders in Cellular Automata." In Cellular Automata, 261–73. New York, NY: Springer US, 2009. http://dx.doi.org/10.1007/978-1-4939-8700-9_249.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Gravner, Janko. "Growth Phenomena in Cellular Automata." In Cellular Automata, 291–308. New York, NY: Springer US, 2018. http://dx.doi.org/10.1007/978-1-4939-8700-9_266.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Adamatzky, Andrew. "Identification of Cellular Automata." In Cellular Automata, 733–47. New York, NY: Springer US, 2018. http://dx.doi.org/10.1007/978-1-4939-8700-9_280.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Voorhees, Burton. "Additive Cellular Automata." In Cellular Automata, 129–51. New York, NY: Springer US, 2009. http://dx.doi.org/10.1007/978-1-4939-8700-9_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Boccara, Nino. "Phase Transitions in Cellular Automata." In Cellular Automata, 705–18. New York, NY: Springer US, 2009. http://dx.doi.org/10.1007/978-1-4939-8700-9_405.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Cellular automata"

1

Perdang, J. M., and A. Lejeune. "Cellular Automata." In Workshop on Cellular Automata Models for Astrophysical Phenomena. WORLD SCIENTIFIC, 1993. http://dx.doi.org/10.1142/9789814535908.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Andreica, Anca. "Cellular Automata Applications." In 2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC). IEEE, 2019. http://dx.doi.org/10.1109/synasc49474.2019.00008.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Zhang, Chao, and Hessam S. Sarjoughian. "Cellular Automata DEVS." In SIMUTOOLS '17: 10th EAI International Conference on Simulation Tools and Techniques. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3173519.3173534.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

"Bondable cellular automata." In ECAL 2011: The 11th European Conference on Artificial Life. MIT Press, 2011. http://dx.doi.org/10.7551/978-0-262-29714-1-ch051.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Ashlock, Daniel, and Carolyn Pugh. "Evolutionary cellular automata bonsai." In 2013 IEEE Congress on Evolutionary Computation (CEC). IEEE, 2013. http://dx.doi.org/10.1109/cec.2013.6557587.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Dantchev, Stefan. "Dynamic Neighbourhood Cellular Automata." In Visions of Computer Science - BCS International Academic Conference. BCS Learning & Development, 2008. http://dx.doi.org/10.14236/ewic/vocs2008.6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Demény, Mária, Géza Horváth, Csaba Nagylaki, and Zoltán Nagylaki. "Visualization of Cellular Automata." In Proceedings of the International Colloquium. WORLD SCIENTIFIC, 2003. http://dx.doi.org/10.1142/9789812704979_0011.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Bernstein, Gary H. "Quantum-dot cellular automata." In the 40th conference. New York, New York, USA: ACM Press, 2003. http://dx.doi.org/10.1145/775832.775900.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Pulecio, Javier F., and Sanjukta Bhanja. "Magnetic Cellular Automata wires." In 2009 IEEE Nanotechnology Materials and Devices Conference (NMDC). IEEE, 2009. http://dx.doi.org/10.1109/nmdc.2009.5167576.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Grasso, Caitlin, and Josh Bongard. "Empowered neural cellular automata." In GECCO '22: Genetic and Evolutionary Computation Conference. New York, NY, USA: ACM, 2022. http://dx.doi.org/10.1145/3520304.3529067.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Cellular automata"

1

Orhai, Max. Cellular Automata as Cellular Spaces. Portland State University Library, January 2014. http://dx.doi.org/10.15760/honors.90.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Meyer, David A. Knot Invariants and Cellular Automata. Fort Belvoir, VA: Defense Technical Information Center, May 1993. http://dx.doi.org/10.21236/ada264199.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Jen, E., R. Das, and C. E. Beasley. Particles and Patterns in Cellular Automata. Office of Scientific and Technical Information (OSTI), June 1999. http://dx.doi.org/10.2172/763243.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Dress, W. B., T. Zacharia, and B. Radhakrishnan. Cellular automata modeling of weld solidification structure. Office of Scientific and Technical Information (OSTI), December 1993. http://dx.doi.org/10.2172/244608.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Cenek, Martin. Information Processing in Two-Dimensional Cellular Automata. Portland State University Library, January 2000. http://dx.doi.org/10.15760/etd.275.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Johnson, Mark. Dynamic Scaling in Cellular Automata Simulations of Deposition Processes. Fort Belvoir, VA: Defense Technical Information Center, March 2000. http://dx.doi.org/10.21236/ada375200.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Crutchfield, J. P., and M. Mitchell. Evolving cellular automata to perform computations. Final technical report. Office of Scientific and Technical Information (OSTI), April 1998. http://dx.doi.org/10.2172/584960.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Meisel, Lawrence V., and Mark A. Johnson. Fractal Scaling in Cellular Automata Simulations of Dissipative Dynamical Systems. Fort Belvoir, VA: Defense Technical Information Center, July 1996. http://dx.doi.org/10.21236/ada315392.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Abarbanel, H., K. Case, A. Despain, F. Dyson, and M. Freeman. Cellular Automata and Parallel Processing for Practical Fluid-Dynamics Problems. Fort Belvoir, VA: Defense Technical Information Center, September 1990. http://dx.doi.org/10.21236/ada229234.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Fenwick, J. W., and L. J. Dowell. Electrical substation service-area estimation using Cellular Automata: An initial report. Office of Scientific and Technical Information (OSTI), July 1998. http://dx.doi.org/10.2172/319895.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Cellular automata' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography