Relevant bibliographies by topics / Cellular automata – Computer programs

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Cellular automata – Computer programs'

Author: Grafiati
Published: 4 June 2021
Last updated: 1 February 2022

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

Select a source type:

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

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 – Computer programs"

1

Skoneczny, Szymon. "Cellular automata-based modelling and simulation of biofilm structure on multi-core computers." Water Science and Technology 72, no. 11 (August 14, 2015): 2071–81. http://dx.doi.org/10.2166/wst.2015.426.

Full text
Abstract:
The article presents a mathematical model of biofilm growth for aerobic biodegradation of a toxic carbonaceous substrate. Modelling of biofilm growth has fundamental significance in numerous processes of biotechnology and mathematical modelling of bioreactors. The process following double-substrate kinetics with substrate inhibition proceeding in a biofilm has not been modelled so far by means of cellular automata. Each process in the model proposed, i.e. diffusion of substrates, uptake of substrates, growth and decay of microorganisms and biofilm detachment, is simulated in a discrete manner. It was shown that for flat biofilm of constant thickness, the results of the presented model agree with those of a continuous model. The primary outcome of the study was to propose a mathematical model of biofilm growth; however a considerable amount of focus was also placed on the development of efficient algorithms for its solution. Two parallel algorithms were created, differing in the way computations are distributed. Computer programs were created using OpenMP Application Programming Interface for C ++ programming language. Simulations of biofilm growth were performed on three high-performance computers. Speed-up coefficients of computer programs were compared. Both algorithms enabled a significant reduction of computation time. It is important, inter alia, in modelling and simulation of bioreactor dynamics.
APA, Harvard, Vancouver, ISO, and other styles
2

Uragami, Daisuke, and Yukio-Pegio Gunji. "2P463 Lattice-Driven Cellular Automata : Computer Simulation Model of Local Semantics(50. Non-equilibrium and complex system,Poster Session,Abstract,Meeting Program of EABS & BSJ 2006)." Seibutsu Butsuri 46, supplement2 (2006): S411. http://dx.doi.org/10.2142/biophys.46.s411_3.

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

Sipper, Moshe. "Fifty Years of Research on Self-Replication: An Overview." Artificial Life 4, no. 3 (July 1998): 237–57. http://dx.doi.org/10.1162/106454698568576.

Full text
Abstract:
The study of artificial self-replicating structures or machines has been taking place now for almost half a century. My goal in this article is to present an overview of research carried out in the domain of self-replication over the past 50 years, starting from von Neumann's work in the late 1940s and continuing to the most recent research efforts. I shall concentrate on computational models, that is, ones that have been studied from a computer science point of view, be it theoretical or experimental. The systems are divided into four major classes, according to the model on which they are based: cellular automata, computer programs, strings (or strands), or an altogether different approach. With the advent of new materials, such as synthetic molecules and nanomachines, it is quite possible that we shall see this somewhat theoretical domain of study producing practical, real-world applications.
APA, Harvard, Vancouver, ISO, and other styles
4

Yañez, Osvaldo, Rodrigo Báez-Grez, Diego Inostroza, Walter A. Rabanal-León, Ricardo Pino-Rios, Jorge Garza, and W. Tiznado. "AUTOMATON: A Program That Combines a Probabilistic Cellular Automata and a Genetic Algorithm for Global Minimum Search of Clusters and Molecules." Journal of Chemical Theory and Computation 15, no. 2 (December 13, 2018): 1463–75. http://dx.doi.org/10.1021/acs.jctc.8b00772.

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

Dennunzio, Alberto, Pierre Guillon, and Benoît Masson. "Sand automata as cellular automata." Theoretical Computer Science 410, no. 38-40 (September 2009): 3962–74. http://dx.doi.org/10.1016/j.tcs.2009.06.016.

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

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
7

Bandini, Stefania, and Giancarlo Mauri. "Multilayered cellular automata." Theoretical Computer Science 217, no. 1 (March 1999): 99–113. http://dx.doi.org/10.1016/s0304-3975(98)00152-2.

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

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
9

Stauffer, D. "Computer simulations of cellular automata." Journal of Physics A: Mathematical and General 24, no. 5 (March 7, 1991): 909–27. http://dx.doi.org/10.1088/0305-4470/24/5/007.

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

Mayer, Gary R., and Hessam S. Sarjoughian. "Composable Cellular Automata." SIMULATION 85, no. 11-12 (July 17, 2009): 735–49. http://dx.doi.org/10.1177/0037549709106341.

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

Dissertations / Theses on the topic "Cellular automata – Computer programs"

1

Bolduc, Jean-Sébastien. "Cellular-automata based nonlinear adaptive controllers." Thesis, McGill University, 1998. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=20804.

Full text
Abstract:
An analytical approach is obviously practical only when we want to study nonlinear systems of low complexity. An alternative for more complex processes that has raised a lot of interest in recent years relies on Artificial Neural Networks (ANNs).
In this work we will explore an alternative avenue to the problems of control and identification, where Cellular Automata (CAs) will be considered in place of ANNs. CAs not only share ANNs' most valuable characteristics but they also have interesting characteristics of their own, for a structurally simpler architecture. CAs applications so far have been mainly restrained to simulating natural phenomena occuring in a finite homogeneous space.
Concepts relevant to the problems of control and identification will be introduced in the first part of our work. CAs will then be introduced, with a discussion of the issues raised by their application in the context, A working prototype of a CA-based controller is introduced in the last part of the work, that confirms the interest of using CAs to address the problem of nonlinear adaptive control. (Abstract shortened by UMI.)
APA, Harvard, Vancouver, ISO, and other styles
2

Ratitch, Bohdana. "Continuous function identification with fuzzy cellular automata." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape10/PQDD_0006/MQ44255.pdf.

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

Hopman, Ryan. "Aribitrary geometry cellular automata for elastodynamics." Thesis, Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/29742.

Full text
Abstract:
Thesis (M. S.)--Mechanical Engineering, Georgia Institute of Technology, 2010.
Committee Chair: Dr. Michael Leamy; Committee Member: Dr. Karim Sabra; Committee Member: Dr. Aldo Ferri. Part of the SMARTech Electronic Thesis and Dissertation Collection.
APA, Harvard, Vancouver, ISO, and other styles
4

Agin, Ruben. "Logic simulation on a cellular automata machine." Thesis, Massachusetts Institute of Technology, 1997. http://hdl.handle.net/1721.1/43474.

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

Adams, Roxane. "Implementation of cell clustering in cellular automata." Thesis, Stellenbosch : University of Stellenbosch, 2011. http://hdl.handle.net/10019.1/6674.

Full text
Abstract:
Thesis (MSc (Mathematical Sciences)) University of Stellenbosch, 2011.
ENGLISH ABSTRACT: Cellular Automata (CA) have become a popular vehicle to study complex dynamical behaviour of systems. CA can be used to model a wide variety of physical, biological, chemical and other systems. Such systems typically consist of subparts that change their state independently, based on the state of their immediate surroundings and some generally shared laws of change. When the CA approach was used to solve the LEGO construction problem, the best solution was found when using a variant of CA allowing for the clustering of cells. The LEGO construction problem concerns the optimal layout of a set of LEGO bricks. The advantages found for using the CA method with clustering in this case are the ease of implementation, the significantly smaller memory usage to previously implemented methods, and its trivial extension to construct multicoloured LEGO sculptures which were previously too complex to construct. In our research we propose to explore the definitions of clustering in CA and investigate the implementation and application of this method. We look at the ant sorting method described by Lumer and Faieta, and compare the implementation of this algorithm using regular CA as well as the clustering variation. The ant sorting model is a simple model, in which ants move randomly in space and pick up and deposit objects on the basis of local information.
AFRIKAANSE OPSOMMING: Sellulêre Outomate (SO) het ’n populêre metode geword om die komplekse dinamiese gedrag van sisteme bestudeer. SO kan gebruik word om ’n groot verskeidenheid fisiese, biologiese, chemiese en ander tipe sisteme te modelleer. Sulke sisteme bestaan tipies uit subafdelings wat, gebaseer op die status van hulle omgewing en ’n paar algemene gedeelde reëls van verandering, hulle status onafhanklik verander. Met die gebruik van die SO benadering om the LEGO konstruksieprobleem op te los, is die beste oplossing bereik deur gebruik te maak van ’n variant van SO, waar selle saamgroepeer kan word. Die LEGO konstruksieprobleem behels die optimale uitleg van ’n stel LEGO blokkies. In hierdie geval is die voordele van die SO met sel groepering die maklike implementasie, ’n beduidende kleiner geheuegebruik teenoor voorheen geïmplementeerde metodes, en die triviale uitbreiding daarvan om gekleurde LEGO beelde wat voorheen te kompleks was, te kan bou. In ons ondersoek verken ons die definisies van selgroepering in SO en ondersoek die implementasie en toepassing van die metode. Ons kyk na die miersorteringsmetode beskryf deur Lumer en Faieta, en vergelyk die implementasie van hierdie algoritme deur gewone SO asook die groeperingsvariasie te gebruik. Die miersorteringsmodel is ’n eenvoudige model waarin miere lukraak in ’n omgewing beweeg en voorwerpe optel of neersit volgens plaaslike inligting.
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

Sahota, Parminda. "Evolving cellular automata molecular computer models using genetic algorithms." Thesis, University of Nottingham, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.362898.

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

Risacher, Daniel R. (Daniel Robert). "Design and implementation of a compiler for cellular automata machines." Thesis, Massachusetts Institute of Technology, 1996. http://hdl.handle.net/1721.1/38807.

Full text
Abstract:
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1996.
Includes bibliographical references (p. 152).
by Daniel R. Risacher.
M.Eng.
APA, Harvard, Vancouver, ISO, and other styles
9

Xie, Jingnan. "Complexity Theoretic Parallels Among Automata, Formal Languages and Real Variables Including Multi-Patterns, L-Systems and Cellular Automata." Thesis, State University of New York at Albany, 2017. http://pqdtopen.proquest.com/#viewpdf?dispub=10272502.

Full text
Abstract:

In this dissertation, we emphasize productiveness not just undecidability since pro- ductiveness implies constructive incompleteness. Analogues of Rice?s Theorem for different classes of languages are investigated, refined and generalized. In particular, several sufficient but general conditions are presented for predicates to be as hard as some widely discussed predicates such as ?= ?? and ?= {0,1}??. These conditions provide several general methods for proving complexity/productiveness results and apply to a large number of simple and natural predicates. As the first step in apply- ing these general methods, we investigate the complexity/productiveness of the pred- icates ?= ??, ?= {0,1}?? and other predicates that can be useful sources of many- one reductions for different classes of languages. Then we use very efficient many- one reductions of these basic source predicates to prove many new non-polynomial complexity lower bounds and productiveness results. Moreover, we study the com- plexity/productiveness of predicates for easily recognizable subsets of instances with important semantic properties. Because of the efficiency of our reductions, intuitively these reductions can preserve many levels of complexity. We apply our general methods to pattern languages [1] and multi-pattern lan- guages [2]. Interrelations between multi-pattern languages (or pattern languages) and standard classes of languages such as context-free languages and regular languages are studied. A way to study the descriptional complexity of standard language descriptors (for examples, context-free grammars and regular expressions) and multi-patterns is illustrated. We apply our general methods to several generalizations of regular ex- pressions. A productiveness result for the predicate ?= {0,1}?? is established for synchronized regular expressions [3]. Because of this, many new productiveness re- sults for synchronized regular expressions follow easily. We also apply our general methods to several classes of Lindenmayer systems [4] and of cellular automata [5]. A way of studying the complexity/productiveness of the 0Lness problem is developed and many new results follow from it. For real time one-way cellular automata, we observe that the predicates ?= ?? and ?= {0,1}?? are both productive. Because vi of this, many more general results are presented. For two-way cellular automata, we prove a strong meta-theorem and give a complete characterization for testing containment of any fixed two-way cellular automaton language. Finally, we generalize our methods and apply them to the theory of functions of real variables. In rings, the equivalence to identically 0 function problem which is an analogue of ?= ?? is studied. We show that the equivalence to identically 0 function problem for some classes of elementary functions is productive for different domains including open and closed bounded intervals of real numbers. Two initial results for real fields are also presented.

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

Brown, Robert L. "Application of Cellular Automata to Detection of Malicious Network Packets." NSUWorks, 2014. http://nsuworks.nova.edu/gscis_etd/106.

Full text
Abstract:
A problem in computer security is identification of attack signatures in network packets. An attack signature is a pattern of bits that characterizes a particular attack. Because there are many kinds of attacks, there are potentially many attack signatures. Furthermore, attackers may seek to avoid detection by altering the attack mechanism so that the bit pattern presented differs from the known signature. Thus, recognizing attack signatures is a problem in approximate string matching. The time to perform an approximate string match depends upon the length of the string and the number of patterns. For constant string length, the time to matchnpatterns is approximatelyO(n); the time increases approximately linearly as the number of patterns increases. A binary cellular automaton is a discrete, deterministic system of cells in which each cell can have one of two values. Cellular automata have the property that the next state of each cell can be evaluated independently of the others. If there is a processing element for each cell, the next states of all cells in a cellular automaton can be computed simultaneously. Because there is no programming paradigm for cellular automata, cellular automata to perform specific functions are createdad hocby hand or discovered using search methods such as genetic algorithms. This research has identified, through evolution by genetic algorithm, cellular automata that can perform approximate string matching for more than one pattern while operating in constant time with respect to the number of patterns, and in the presence of noise. Patterns were recognized by using the bits of a network packet payload as the initial state of a cellular automaton. After a predetermined number of cycles, the ones density of the cellular automaton was computed. Packets for which the ones density was below an experimentally determined threshold were identified as target packets. Six different cellular automaton rules were tested against a corpus of 7.2 million TCP packets in the IDEval data set. No rule produced false negative results, and false positive results were acceptably low.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Cellular automata – Computer programs"

1

Ladd, Scott Robert. C++ simulations and cellular automata. New York: M&T Books, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

C[plus plus] simulations and cellular automata. New York: M&T Books, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Gaylord, Richard J. Modeling nature: Cellular automata simulations with Mathematica. Santa Clara, CA: TELOS, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

1956-, Bandini S. (Stefania), and SpringerLink (Online service), eds. Cellular Automata: 10th International Conference on Cellular Automata for Research and Industry, ACRI 2012, Santorini Island, Greece, September 24-27, 2012. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

International Conference on Cellular Automata for Research and Industry (6th 2004 Amsterdam, Netherlands). Cellular automata: 6th International Conference on Cellular Automata for Research and Industry, ACRI 2004, Amsterdam, the Netherlands, October 25-27, 2004 : proceedings. Berlin: Springer, 2004.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

S, Zaleski, ed. Lattice-gas cellular automata: Simple models of complex hydrodynamics. Cambridge, U.K: Cambridge University Press, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Dailey, Daniel J. A cellular automata model for use with real freeway data. [Olympia, Wash.]: Washington State Dept. of Transportation, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Lafe, Olu. Cellular Automata Transforms: Theory and Applications in Multimedia Compression, Encryption, and Modeling. Boston, MA: Springer US, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Laboratoire informatique théorique et programmation. Spring School. Automata networks: LITP Spring School on theoretical computer science, Argelès-village, France, May 12-16, 1986 : proceedings. Berlin: Springer-Verlag, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Universality and emergent computation in cellular neural networks. Singapore: World Scientific, 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Cellular automata – Computer programs"

1

Folino, Gianluigi, and Giandomenico Spezzano. "Scalability Analysis and Performance Prediction for Cellular Programs on Parallel Computers." In Theory and Practical Issues on Cellular Automata, 37–46. London: Springer London, 2001. http://dx.doi.org/10.1007/978-1-4471-0709-5_5.

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

Bubak, Marian. "2-D cellular automata and short range molecular dynamics programs for simulations on networked workstations and parallel computers." In Lecture Notes in Computer Science, 61–68. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-60902-4_8.

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

Seredyński, Franciszek. "Scheduling tasks of a parallel program in two-processor systems with use of cellular automata." In Lecture Notes in Computer Science, 261–69. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/3-540-64359-1_696.

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

Poupet, Victor. "Simulating 3D Cellular Automata with 2D Cellular Automata." In Lecture Notes in Computer Science, 439–50. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-28629-5_33.

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

Theyssier, Guillaume. "Captive Cellular Automata." In Lecture Notes in Computer Science, 427–38. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-28629-5_32.

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

Judice, Sicilia Ferreira. "Cellular Automata Methods." In Encyclopedia of Computer Graphics and Games, 1–10. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-08234-9_183-1.

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

Blair, Howard A., Fred Dushin, and Polar Humenn. "Simulations between programs as cellular automata." In Logic Programming And Nonmonotonic Reasoning, 115–31. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-63255-7_9.

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

Morita, Kenichi. "Reversible Cellular Automata." In Monographs in Theoretical Computer Science. An EATCS Series, 261–98. Tokyo: Springer Japan, 2017. http://dx.doi.org/10.1007/978-4-431-56606-9_10.

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

Stauffer, Dietrich, Friedrich W. Hehl, Nobuyasu Ito, Volker Winkelmann, and John G. Zabolitzky. "Cellular Automata (Q2R and Creutz)." In Computer Simulation and Computer Algebra, 85–89. Berlin, Heidelberg: Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/978-3-642-78117-9_10.

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

Sutner, K. "Universality and Cellular Automata." In Lecture Notes in Computer Science, 50–59. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-540-31834-7_4.

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

Conference papers on the topic "Cellular automata – Computer programs"

1

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
2

Yao Qin, Huchuan Lu, Yiqun Xu, and He Wang. "Saliency detection via Cellular Automata." In 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR). IEEE, 2015. http://dx.doi.org/10.1109/cvpr.2015.7298606.

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

Yanggratoke, Kanjanawit, and Songphol Kanjanachuchai. "Hybrid Quantum Cellular Automata memory." In 2008 5th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology (ECTI-CON). IEEE, 2008. http://dx.doi.org/10.1109/ecticon.2008.4600565.

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

Du, Tingsong, Pusheng Fei, and Jigui Jian. "A New Cellular Automata-Based Mixed Cellular Ant Algorithm for Solving Continuous System Optimization Programs." In 2008 Fourth International Conference on Natural Computation. IEEE, 2008. http://dx.doi.org/10.1109/icnc.2008.393.

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

Yang, Shuo. "Mixed Traffic Flow Model with Cellular Automata." In 2016 International Conference on Sensor Network and Computer Engineering. Paris, France: Atlantis Press, 2016. http://dx.doi.org/10.2991/icsnce-16.2016.31.

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

Khani, Farnaz, Arash Ahmadi, Shahpour Alirezaee, and Majid Ahmadi. "A cellular automata based Izhikevich neuron model." In 2016 IEEE Canadian Conference on Electrical and Computer Engineering (CCECE). IEEE, 2016. http://dx.doi.org/10.1109/ccece.2016.7726743.

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

"Faster cellular automata cryptosystems with neighbor sequences." In 2017 the 7th International Workshop on Computer Science and Engineering. WCSE, 2017. http://dx.doi.org/10.18178/wcse.2017.06.164.

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

Makanda, Kondwani, and Jun-Cheol Jeon. "Design of Fast Quantum-dot Cellular Automata Decoder." In Information Technology and Computer Science 2015. Science & Engineering Research Support soCiety, 2015. http://dx.doi.org/10.14257/astl.2015.99.64.

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

"Collapsed sandcastle model based on cellular automata." In 2020 4th International Conference on Computer Engineering, Information Science & Application Technology. Clausius Scientific Press, 2020. http://dx.doi.org/10.23977/iccia2020009.

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

Choudhury, Salimur, Kai Salomaa, and Selim G. Akl. "Cellular automata and Mobile Wireless Sensor Networks." In 2014 IEEE 27th Canadian Conference on Electrical and Computer Engineering (CCECE). IEEE, 2014. http://dx.doi.org/10.1109/ccece.2014.6900990.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Cellular automata – Computer programs' 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