Thematische Bibliographien / Cellulära automater

Inhaltsverzeichnis

  1. Zeitschriftenartikel
  2. Dissertationen
  3. Bücher
  4. Buchteile
  5. Konferenzberichte
  6. Berichte der Organisationen

Auswahl der wissenschaftlichen Literatur zum Thema „Cellulära automater“

Autor: Grafiati
Veröffentlicht am 4. Juni 2021
Zuletzt aktualisiert am 18. Februar 2022

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Cellulära automater" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Cellulära automater"

1

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 (2021): 139–52. http://dx.doi.org/10.25202/jakg.10.1.9.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

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

Der volle Inhalt der Quelle
Annotation:
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 s
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Rowland, Eric, and Reem Yassawi. "Automaticity and Invariant Measures of Linear Cellular Automata." Canadian Journal of Mathematics 72, no. 6 (2019): 1691–726. http://dx.doi.org/10.4153/s0008414x19000488.

Der volle Inhalt der Quelle
Annotation:
AbstractWe show that spacetime diagrams of linear cellular automata $\unicode[STIX]{x1D6F7}:\,\mathbb{F}_{p}^{\mathbb{Z}}\rightarrow \mathbb{F}_{p}^{\mathbb{Z}}$ with $(-p)$-automatic initial conditions are automatic. This extends existing results on initial conditions that are eventually constant. Each automatic spacetime diagram defines a $(\unicode[STIX]{x1D70E},\unicode[STIX]{x1D6F7})$-invariant subset of $\mathbb{F}_{p}^{\mathbb{Z}}$, where $\unicode[STIX]{x1D70E}$ is the left shift map, and if the initial condition is not eventually periodic, then this invariant set is nontrivial. For th
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Barragan-Vite, Irving, Juan C. Seck-Tuoh-Mora, Norberto Hernandez-Romero, Joselito Medina-Marin, and Eva S. Hernandez-Gress. "Distributed Control of a Manufacturing System with One-Dimensional Cellular Automata." Complexity 2018 (October 4, 2018): 1–15. http://dx.doi.org/10.1155/2018/7235105.

Der volle Inhalt der Quelle
Annotation:
We present a distributed control modeling approach for an automated manufacturing system based on the dynamics of one-dimensional cellular automata. This is inspired by the fact that both cellular automata and manufacturing systems are discrete dynamical systems where local interactions given among their elements (resources) can lead to complex dynamics, despite the simple rules governing such interactions. The cellular automaton model developed in this study focuses on two states of the resources of a manufacturing system, namely, busy or idle. However, the interaction among the resources suc
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

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 (2015): 2476–89. http://dx.doi.org/10.1109/tc.2014.2366745.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Mardiris, V. A., and I. G. Karafyllidis. "Universal cellular automaton cell using quantum cellular automata." Electronics Letters 45, no. 12 (2009): 607. http://dx.doi.org/10.1049/el.2009.3693.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

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

Der volle Inhalt der Quelle
Annotation:
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 und andere Zitierweisen
8

Allouche, J. P., F. V. Haeseler, E. Lange, A. Petersen, and G. Skordev. "Linear cellular automata and automatic sequences." Parallel Computing 23, no. 11 (1997): 1577–92. http://dx.doi.org/10.1016/s0167-8191(97)00074-4.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

DUBACQ, JEAN-CHRISTOPHE. "HOW TO SIMULATE TURING MACHINES BY INVERTIBLE ONE-DIMENSIONAL CELLULAR AUTOMATA." International Journal of Foundations of Computer Science 06, no. 04 (1995): 395–402. http://dx.doi.org/10.1142/s0129054195000202.

Der volle Inhalt der Quelle
Annotation:
The issue of testing invertibility of cellular automata has been often discussed. Constructing invertible automata is very useful for simulating invertible dynamical systems, based on local rules. The computation universality of cellular automata has long been positively resolved, and by showing that any cellular automaton could be simulated by an invertible one having a superior dimension, Toffoli proved that invertible cellular automaton of dimension d≥2 were computation-universal. Morita proved that any invertible Turing Machine could be simulated by a one-dimensional invertible cellular au
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Wang, Jiawen, Shaobo Li, Yining Lu, and Lubang Wang. "A Division Method of Determining the Early-Warning Zone on an Expressway for Automated Vehicles." Discrete Dynamics in Nature and Society 2020 (April 21, 2020): 1–10. http://dx.doi.org/10.1155/2020/9523819.

Der volle Inhalt der Quelle
Annotation:
Using a cellular automaton model, this paper studied the evolution mechanism of traffic incidents affecting the capacity of urban expressway under the mixed traffic environment of manual driving and automatic driving. It showed that the length of the automated-driving early-warning zone could affect the capacity of expressway. Specifically, the early-warning zone is divided into an accelerate lane-changing area, a decelerate lane-changing area, and a forced lane-changing area. The areas vary according to the distance between the vehicle and the location of incident. Based on the study, this pa
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Mehr Quellen

Dissertationen zum Thema "Cellulära automater"

1

Wahlman, Kim. "Procedurellt genererade grottnivåer : En jämförelse mellan cellulära automater och diffusionsbegränsad aggregation." Thesis, Högskolan i Skövde, Institutionen för informationsteknologi, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-12393.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Herr, Christiane Margerita. "From form generators to automated diagrams using cellular automata to support architectural design /." Thesis, Click to view the E-thesis via HKUTO, 2008. http://sunzi.lib.hku.hk/hkuto/record/B39848954.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Olkerud, Marcus, and Martin Virke. "Processuell generering av oändliga spelvärldar : Praktiska problem och optimering." Thesis, Södertörns högskola, Institutionen för naturvetenskap, miljö och teknik, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:sh:diva-22949.

Der volle Inhalt der Quelle
Annotation:
Enligt oss så är det största problemet med att processuellt generera en pseudo-oändlig spelvärld i realtid är att få genereringen att ske så sömlöst som möjligt samtidigt som världen upplevs som konsekvent. För att finna lösningar på detta problem så analyserar vi andra studier och spel som utnyttjar processuell generering. Vi använder sedan de metoder och tekniker vi funnit för skapandet av en egen applikation för att få en djupare förståelse för hur dessa fungerar i praktiken och hur mycket varje metod påverkar prestandan. I vår slutsats beskriver vi de problem vi fann, deras orsak och ger f
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Skorkovský, Petr. "Tvorba operačního systému založeného na evolučních a genetických algoritmech." Doctoral thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2013. http://www.nusl.cz/ntk/nusl-233610.

Der volle Inhalt der Quelle
Annotation:
The main goal of the work is to introduce new ideas how traditional approaches for designing an operation system and associated software can be improved to be a part of automatic software evolution. It is generally supposed that algorithms found by the genetic programming processes cannot be used for exact calculations but only for approximate solutions. Several examples of software evolution are introduced, to show that quite precise solutions can be achieved. To reach this goal, characteristics of tree-like structures with approaches based on cellular automata features are combined in a new
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Luža, Jindřich. "Návrh výpočetních struktur v celulárních automatech." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2014. http://www.nusl.cz/ntk/nusl-236089.

Der volle Inhalt der Quelle
Annotation:
The goal of this master thesis is to examine possibilities of realizing comptutational structures in cellular automata. The work describes the fundamental principles of cellular automata and summarizes some ways of how to achive the specified goal. An overview of Turing-complete and other specialized computational tasks is proposed considering both 1D and 2D cellular automata. It is shown that different computational scenarios in cellular automata can be considered with various setups of the input and output arrangements. With regard to showed inputs and outputs arrangement, sets of tests is d
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

NETO, OMAR PARANAIBA VILELA. "SIMULATION AND AUTOMATIC SYNTHESES OF QUANTUM DOTS CELLULAR AUTOMATA CIRCUITS THOUGHT INTELLIGENT TECHNIQUES." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2006. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=8729@1.

Der volle Inhalt der Quelle
Annotation:
CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO<br>Esta dissertação investiga e propõe um novo simulador de circuitos de Autômatos Celulares com Pontos Quânticos (QCA) e uma nova metodologia para a criação e otimização de circuitos lógicos, utilizando técnicas da inteligência computacional. Autômatos Celulares com Pontos Quânticos é uma nova tecnologia, na escala nanométrica, que tem chamado a atenção dos pesquisadores por ser uma alternativa à tecnologia CMOS, cujo limite físico de miniaturização será atingido nos próximos anos. QCA tem um grande potencial no desenvolvime
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Besson, Tom. "Discrétisation automatique de machines à signaux en automates cellulaires." Thesis, Orléans, 2018. http://www.theses.fr/2018ORLE2009/document.

Der volle Inhalt der Quelle
Annotation:
Dans le contexte du calcul géométrique abstrait, les machines à signaux ont été développées comme le pendant continu des automates cellulaires capturant les notions de particules, de signaux et de collisions. Une question importante est la génération automatique d’un automate cellulaire reproduisant la dynamique d’une machine à signaux donnée. D’une part, il existe des conversions ad hoc. D’autre part, ce n’est pas toujours possible car certaines machines à signaux présentent des comportements « continus ». Par conséquent, la discrétisation automatique de telles structures est souvent complexe
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Louis, Pierre-Yves. "Increasing coupling for probabilistic cellular automata." Universität Potsdam, 2005. http://opus.kobv.de/ubp/volltexte/2006/659/.

Der volle Inhalt der Quelle
Annotation:
We give a necessary and sufficient condition for the existence of an increasing coupling of N (N >= 2) synchronous dynamics on S-Zd (PCA). Increasing means the coupling preserves stochastic ordering. We first present our main construction theorem in the case where S is totally ordered; applications to attractive PCAs are given. When S is only partially ordered, we show on two examples that a coupling of more than two synchronous dynamics may not exist. We also prove an extension of our main result for a particular class of partially ordered spaces.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

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.

Der volle Inhalt der Quelle
Annotation:
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-homeomorp
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Mehr Quellen

Bücher zum Thema "Cellulära automater"

1

Game of life cellular automata. Springer, 2010.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Li, Thomas M. Cellular automata. Nova Science Publishers, 2010.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

El Yacoubi, Samira, Bastien Chopard, and Stefania Bandini, eds. Cellular Automata. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11861201.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Sloot, Peter M. A., Bastien Chopard, and Alfons G. Hoekstra, eds. Cellular Automata. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/b102055.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Mehr Quellen

Buchteile zum Thema "Cellulära automater"

1

Margenstern, Maurice. "Cellular Automata in Hyperbolic Spaces." In Cellular Automata. Springer US, 2018. http://dx.doi.org/10.1007/978-1-4939-8700-9_53.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Delorme, M. "An Introduction to Cellular Automata." In Cellular Automata. Springer Netherlands, 1999. http://dx.doi.org/10.1007/978-94-015-9153-9_1.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Bardou, A. L., P. M. Auger, R. Seigneuric, and J.-L. Chassé. "Cellular Automata Models and Cardiac Arrhythmias." In Cellular Automata. Springer Netherlands, 1999. http://dx.doi.org/10.1007/978-94-015-9153-9_10.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Cosnard, M. "Dynamic Properties of an Automaton with Memory." In Cellular Automata. Springer Netherlands, 1999. http://dx.doi.org/10.1007/978-94-015-9153-9_11.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Sutner, K. "Linear Cellular Automata and de Bruijn Automata." In Cellular Automata. Springer Netherlands, 1999. http://dx.doi.org/10.1007/978-94-015-9153-9_12.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Allouche, J. P. "Cellular Automata, Finite Automata, and Number Theory." In Cellular Automata. Springer Netherlands, 1999. http://dx.doi.org/10.1007/978-94-015-9153-9_13.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Čulik, K. "Decision Problems on Global Cellular Automata." In Cellular Automata. Springer Netherlands, 1999. http://dx.doi.org/10.1007/978-94-015-9153-9_14.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Rémila, E. "An Introduction to Automata on Graphs." In Cellular Automata. Springer Netherlands, 1999. http://dx.doi.org/10.1007/978-94-015-9153-9_15.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Durand, Bruno, and Zsuzsanna Róka. "The Game of Life: Universality Revisited." In Cellular Automata. Springer Netherlands, 1999. http://dx.doi.org/10.1007/978-94-015-9153-9_2.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Mazoyer, J. "Computations on Cellular Automata." In Cellular Automata. Springer Netherlands, 1999. http://dx.doi.org/10.1007/978-94-015-9153-9_3.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Cellulära automater"

1

Arista-Jalife, Antonio, Eduardo Gomez-Ramirez, and Giovanni E. Pazienza. "Automatic implementation of totalistic cellular automata through polynomial cellular neural networks." In 2013 IEEE Workshop on Hybrid Intelligent Models and Applications (HIMA). IEEE, 2013. http://dx.doi.org/10.1109/hima.2013.6615018.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Ravichandran, Ramprasad, Nihal Ladiwala, Jean Nguyen, Mike Niemier, and Sung Kyu Lim. "Automatic cell placement for quantum-dot cellular automata." In Proceedins of the 14th ACM Great Lakes symposium. ACM Press, 2004. http://dx.doi.org/10.1145/988952.989033.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Matic, Ivana D., Antonio Pedro Oliveira, and Amilcar Cardoso. "Automatic melody generation using Neural Networks and Cellular Automata." In 2012 11th Symposium on Neural Network Applications in Electrical Engineering (NEUREL 2012). IEEE, 2012. http://dx.doi.org/10.1109/neurel.2012.6419972.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Bie, Dongyang, Yanhe Zhu, JiZhuang Fan, Xiaolu Wang, Yu Zhang, and Jie Zhao. "A Bioinspired Approach Combining L-Systems and Cellular Automata for Distributed Self-Reconfiguration of UBot Modular Robotic Systems." In ASME 2016 Conference on Information Storage and Processing Systems. American Society of Mechanical Engineers, 2016. http://dx.doi.org/10.1115/isps2016-9539.

Der volle Inhalt der Quelle
Annotation:
Self-reconfiguration of Modular Self-Reconfigurable (MSR) robots is a fundamental primitive that can be used as part of higher-lever functionality. The biological principle of self-organizing and growth in both animals and plants is learned to solve the automatic planning of configuration and control methods. A bioinspired approach is proposed for distributed self-reconfiguration. This method aims at utilizing the self-organization and pattern emergence of the MSR robotic system, which is made of large quantity of modules to promote the system to reconfigure in the direction of adapting to env
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Desbordes, Paul, Caroline Petitjean, and Su Ruan. "3D automated lymphoma segmentation in PET images based on cellular automata." In 2014 4th International Conference on Image Processing Theory, Tools and Applications (IPTA). IEEE, 2014. http://dx.doi.org/10.1109/ipta.2014.7001923.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Kreitzer, Matthew, Daniel Ashlock, and Rajesh Pereira. "Automatic Generation of Diverse Cavern Maps with Morphing Cellular Automata." In 2019 IEEE Conference on Games (CoG). IEEE, 2019. http://dx.doi.org/10.1109/cig.2019.8847947.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Pires, A., D. P. Landau, and H. Herrmann. "Workshop on Computational Physics And Cellular Automata." In Workshop on Computational Physics and Cellular Automata. WORLD SCIENTIFIC, 1990. http://dx.doi.org/10.1142/9789814540940.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

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.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Tholen, Christoph, Lars Nolle, Tarek El-Mihoub, Jan Dierks, Alexandra Burger, and Oliver Zielinski. "Automated Tuning Of A Cellular Automata Using Parallel Asynchronous Particle Swarm Optimisation." In 33rd International ECMS Conference on Modelling and Simulation. ECMS, 2019. http://dx.doi.org/10.7148/2019-0030.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Jordan, Timothy E. "Automated Fastening in a Cellular Manufacturing Environment." In SAE Aerospace Automated Fastening Conference & Exposition. SAE International, 1996. http://dx.doi.org/10.4271/961867.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Berichte der Organisationen zum Thema "Cellulära automater"

1

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Rechtsteiner, Andreas. Complexity Properties of the Cellular Automaton Game of Life. Portland State University Library, 2000. http://dx.doi.org/10.15760/etd.6804.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Chowdhury, Shwetadwip. Automated extraction of cellular features for a potentially robust classification scheme. National Institute of Standards and Technology, 2010. http://dx.doi.org/10.6028/nist.ir.7738.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Die Auswahlen zum Thema "Cellulära automater" für konkrete Quellenarten können Sie auch interessieren:
Zeitschriftenartikel Dissertationen Bücher
Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!

Zur Bibliographie