Filters








576 Hits in 4.5 sec

A new reconstruction and the first implementation of Goto's FSSP algorithm

Hiroshi Umeo, Mitsuki Hirota, Youhei Nozaki, Keisuke Imai, Takashi Sogabe
2018 Applied Mathematics and Computation  
We show that the algorithm has Θ(n log n) minimum-state-change complexity for synchronizing n cells. The algorithm is optimum not only in time but also in state-change complexities.  ...  The firing squad synchronization problem (FSSP) on cellular automata has been studied extensively for more than fifty years, and a rich variety of synchronization algorithms has been proposed.  ...  We show that the algorithm has Θ(n log n) minimum-state-change complexity for synchronizing n cells. The algorithm is optimum not only in time but also in state-change complexities.  ... 
doi:10.1016/j.amc.2017.05.015 fatcat:wbj5imehenayxeallcucd2jmiu

An Overview of Recent Solutions to and Lower Bounds for the Firing Synchronization Problem [article]

Thiago Correa, Breno Gustavo, Lucas Lemos, Amber Settle
2017 arXiv   pre-print
One of the oldest problems associated with cellular automata is the firing synchronization problem, originally proposed by John Myhill in 1957.  ...  We also focus on solutions that minimize the number of states required by the finite automata.  ...  We also did searches for papers including relevant keywords, such as cellular automata, firing synchronization, and firing squad.  ... 
arXiv:1701.01045v1 fatcat:dit5tqmhk5fcbksnoj5j2uh5ri

A Synchronization Problem in Two-Dimensional Cellular Automata [chapter]

Hiroshi Umeo
2009 Natural Computing  
We study a generalized synchronization problem that gives a finite-state protocol for synchronizing a large scale of cellular automata with an initial initiator at any generalized position.  ...  Cellular automata are considered to be a nice model of complex systems in which an infinite onedimensional array of finite state machines (cells) updates itself in synchronous manner according to a uniform  ...  A part of this work has been supported by Grant-in-Aid for Scientific Research (C) 21500023.  ... 
doi:10.1007/978-4-431-88981-6_20 dblp:conf/iwnc/Umeo07 fatcat:pit4pu66angx5oljpqduinclsu

Recent Developments in Firing Squad Synchronization Algorithms: Smaller Solutions

Hiroshi Umeo
2012 2012 Third International Conference on Networking and Computing  
The synchronization in cellular automata has been known as the firing squad synchronization problem (FSSP).  ...  In the present paper, we construct a survey on recent developments in FSSP algorithms for not only one-dimensional but two-dimensional, even multi-dimensional cellular automata, focusing on smaller solutions  ...  Therefore the optimum-time complexity for the GFSSP is min(k−1, n−k) steps smaller than the original FSSP with a general at one end.  ... 
doi:10.1109/icnc.2012.72 dblp:conf/ic-nc/Umeo12 fatcat:fwxtmemrpvaprddrxzu2hf74gm

Fitness Landscapes of Evolved Apoptotic Cellular Automata

Daniel Ashlock, Sharon McNicholas
2013 IEEE Transactions on Evolutionary Computation  
This paper examines the fitness landscape for evolutionary algorithms evolving cellular automata rules to satisfy an apoptotic fitness function.  ...  This fitness function requires the automata to grow as rapidly as possible, and to die out by a fixed time step.  ...  Another commonly studied problem for binary automata is the synchronization problem [14] in which all cells of the automata must be synchronized.  ... 
doi:10.1109/tevc.2013.2243454 fatcat:xjluwtqfurbrvlqu7ceyeasvze

Synchronization of P Systems with Simplex Channels [article]

Florentin Ipate, Radu Nicolescu, Ionut-Mihai Niculescu, Cristian Stefan
2011 arXiv   pre-print
Compared to the known solutions for cellular automata, our solution is substantially simpler and faster.  ...  We solve the Firing Squad Synchronization Problem (FSSP), for P systems based on digraphs with simplex channels, where communication is restricted by the direction of structural arcs.  ...  Thus, in terms of execution time, our P solution compares favourably with the best known solution for cellular automata.  ... 
arXiv:1108.3430v1 fatcat:4rxmkcwxxreunfhx3izenx6gi4

The Algorithm of Continuous Optimization Based on the Modified Cellular Automaton

Oleg Evsutin, Alexander Shelupanov, Roman Meshcheryakov, Dmitry Bondarenko, Angelika Rashchupkina
2016 Symmetry  
This article is devoted to the application of the cellular automata mathematical apparatus to the problem of continuous optimization.  ...  The cellular automaton with an objective function is introduced as a new modification of the classic cellular automaton.  ...  Acknowledgments: The work was supported by the Ministry of Education and Science of the Russian Federation in terms of the basic part of the state order for Tomsk State University of Control Systems and  ... 
doi:10.3390/sym8090084 fatcat:hw7nezubzndcvjavtnlgoxohga

An Iterated Local Search to find many solutions of the 6-states Firing Squad Synchronization Problem

Manuel Clergue, Sébastien Verel, Enrico Formenti
2018 Applied Soft Computing  
This paper proposes an optimization approach for solving a classical problem in cellular automata theory: the 6-states Firing Squad Synchronization Problem (FSSP).  ...  automata computations.  ...  This work addresses a classical problem in the field of cellular automata, namely, the 6-states firing squad synchronization problem (FSSP) [4] , which consists of synchronizing all the cells of the automata  ... 
doi:10.1016/j.asoc.2018.01.026 fatcat:btm2ps32sjhcfb3tz5doai6bre

A Cellular Learning Automata Based Clustering Algorithm for Wireless Sensor Networks

M. Esnaashari, M. R. Meybodi
2008 Sensor Letters  
In the first part of this paper, we propose a generalization of cellular learning automata (CLA) called irregular cellular learning automata (ICLA) which removes the restriction of rectangular grid structure  ...  The proposed clustering algorithm is fully distributed and the nodes in the network don't need to be fully synchronized with each other.  ...  Esnaashari and Meybodi A Cellular Learning Automata Based Clustering Algorithm for Wireless Sensor Networks Cellular Automata Cellular automata are mathematical models for systems consisting of large  ... 
doi:10.1166/sl.2008.m146 fatcat:4i7owvjbvrachkwuumwutnb3dm

Parallel turing machines with one-head control units and cellular automata

Thomas Worsch
1999 Theoretical Computer Science  
Parallel Turing machines (PTM) can be viewed as a generalization of cellular automata (CA) where an additional measure called processor complexity can be defined which indicates the "amount of parallelism  ...  A possible collapse of the time hierarchy for these CA would therefore also imply some unexpected properties of PTM. @ 1999-Elsevier Science B.V. All rights reserved  ...  Balzer [I] has suggested a 3n time FSSP algorithm for cellular automata.  ... 
doi:10.1016/s0304-3975(98)00148-0 fatcat:lftxxkq5e5cjhozhzxndv6rwte

Dynamic simulation of a SEIQR-V epidemic model based on cellular automata

Jiatai Gang, Lisa Huang, Zhiwei Zhao, Sisi Liu, Shujuan Li, Xinxin Tan
2015 Numerical Algebra, Control and Optimization  
A SEIQR-V epidemic model, including the exposure period, is established based on cellular automata.  ...  Referencing the random walk cellular automata and extended Moore neighborhood theories, influenza A(H1N1) is used as example to create a dynamic simulation using Matlab software.  ...  All cellular are synchronously updated at each simulated state, the state of C i,j at time t + 1 is dependent on the state of C i,j and its neighbor's state at t .  ... 
doi:10.3934/naco.2015.5.327 fatcat:wlisnwisqnfsfpei2shhykagom

The Cellular Differential Evolution Based on Chaotic Local Search

Qingfeng Ding, Guoxin Zheng
2015 Mathematical Problems in Engineering  
To avoid immature convergence and tune the selection pressure in the differential evolution (DE) algorithm, a new differential evolution algorithm based on cellular automata and chaotic local search (CLS  ...  To balance the exploration and exploitation tradeoff of differential evolution, the interaction among individuals is limited in cellular neighbors instead of controlling parameters in the canonical DE.  ...  Suganthan at the School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore, for their help to improve the linguistic quality of this paper.  ... 
doi:10.1155/2015/128902 fatcat:cuyloyhz5vdajpeufl6evintk4

Associative cellular learning automata and its applications

Meysam Ahangaran, Nasrin Taghizadeh, Hamid Beigy
2017 Applied Soft Computing  
This model combines the computational power of the cellular automata with the learning power of the learning automata.  ...  Cellular learning automata (CLA) is a distributed computational model which was introduced in the last decade.  ...  Acknowledgements The authors would like to thank the anonymous reviewers for their valuable comments and suggestions which improved the paper.  ... 
doi:10.1016/j.asoc.2016.12.006 fatcat:u37givvcjbejrldq4hvblqknfm

Design of Self-Assembling, Self-Repairing 3D Irregular Cellular Automata [chapter]

David Huw, Richard McWilliam, Alan Purvis
2011 Cellular Automata - Innovative Modelling for Science and Engineering  
Acknowledgements The authors would like to acknowledge the support of the EPSRC for funding the work presented in this chapter.  ...  The conditions for cellular automata convergence Cellular automata (CA) are dynamic systems in which space and time are discrete. CA consist of a number of identical cells pre-arranged into an array.  ...  cellular automata.  ... 
doi:10.5772/16184 fatcat:5ts27x3dundx5dulfashed25my

A High-Performance Cellular Automaton Model of Tumor Growth with Dynamically Growing Domains

Jan Poleszczuk, Heiko Enderling
2014 Applied Mathematics  
Implementation of cellular automata simulations of such tumor growth can be straightforward but computing performance often counterbalances simplicity.  ...  Computationally convenient simulation times can be achieved by choosing appropriate data structures, memory and cell handling as well as domain setup.  ...  Whilst many efficient ways exist to simulate deterministic and synchronous cellular automata, such as Conway's "Game of Life" [16] , high-performance simulation of stochastic cancer cell kinetics and  ... 
doi:10.4236/am.2014.51017 pmid:25346862 pmcid:PMC4208695 fatcat:4d6ikdkahfar3pomnb5y725ije
« Previous Showing results 1 — 15 out of 576 results