• Publications
  • Influence
Definition and Application of a Five-Parameter Characterization of One-Dimensional Cellular Automata Rule Space
Cellular automata (CA) are important as prototypical, spatially extended, discrete dynamical systems. Because the problem of forecasting dynamic behavior of CA is undecidable, various parameter-basedExpand
  • 52
  • 4
The best currently known class of dynamically equivalent cellular automata rules for density classification
Abstract The possibility of performing computations with cellular automata (CAs) opens up new conceptual issues in emergent computation. Driven by this motivation, a recurring problem in this contextExpand
  • 43
  • 3
Secret Key Specification for a Variable-Length Cryptographic Cellular Automata Model
Reverse algorithm was previously evaluated as encryption method concluding that its simple adoption is unviable, since it does not assurance the pre-image existence. Variable-Length Encryption MethodExpand
  • 7
  • 3
A Cellular Automata Model with Repulsive Pheromone for Swarm Robotics in Surveillance
This study proposes an inverted ant cellular automata (IACA) model for swarm robots performing the surveillance task. A new distributed coordination strategy is described here, which was designedExpand
  • 16
  • 2
Investigating a cellular automata model that performs three distance diffusion on a robot path planning
An improved cellular automata (CA) model is proposed and evaluated on a path planning problem for an autonomous robot. The objective is to construct a collision-free path from the robot’s initialExpand
  • 7
  • 2
Exhaustive Evaluation of Radius 2 Toggle Rules for a Variable-Length Cryptographic Cellular Automata-Based Model
A cellular automata (CA) model in cryptography is investigated. A previous work analyzed the usage of reverse algorithm for pre-image computation as an encryption method. The main conclusion was thatExpand
  • 6
  • 2
Some Investigations About Synchronization and Density Classification Tasks in One-dimensional and Two-dimensional Cellular Automata Rule Spaces
The study of computational aspects of cellular automata (CA) is a recurrent theme being that the investigation of specific tasks to be solved by CA rules a common and widely-known approach. WeExpand
  • 29
  • 1
An Improved Cellular Automata-Based Model for Robot Path-Planning
Cellular automata (CA) are able to represent high complex phenomena and can be naturally simulated by digital processors due to its intrinsic discrete nature. CA have been recently considered forExpand
  • 19
  • 1
Guidelines for dynamics-based parameterization of one-dimensional cellular automata rule spaces
As paradigmatic complex systems, various studies have been done in the context of one-dimensional cellular automata (CA) on the definition of parameters directly obtained from their transition rule,Expand
  • 18
  • 1
Multicast flow routing: Evaluation of heuristics and multiobjective evolutionary algorithms
In this work, a multiobjective genetic algorithm-based model for multicast flow routing with QoS and Traffic Engineering requirements is discussed. Two heuristics for subtree reconnection areExpand
  • 19
  • 1