Search
Now showing items 1-10 of 21
Analyzing the spatial dynamics of a prey predator lattice model with social behavior
(2015)
A lattice prey?predator model is studied. Transition rules applied sequentially describe processes such as reproduction, predation, and death of predators. The movement of predators is governed by a local particle swarm ...
Emergence of density dynamics by surface interpolation in elementary cellular automata
(2014)
A classic problem in elementary cellular automata (ECAs) is the specification of numerical tools to represent and study their dynamical behaviour. Mean field theory and basins of
attraction have been commonly used; however, ...
Improving the Multi-Restart Local Search Algorithm by Permutation Matrices and Sorted Completion Times for the Flow Shop Scheduling Problem
(2014)
Iterated local search (ILS) is a metaheuristic
used successfully to solve the flow shop scheduling problem.
In particular, the multi-restart ILS (MRSILS) is an easily
implementable algorithm which obtains good results. ...
Conformación del algoritmo CMA-es para la estimación de parámetros del motor de inducción asíncrono trifásico
(2014)
El CMA-es (Covariance Matrix Adaptation evolution strategy) es un método de optimización relativamente nuevo y hasta el momento de elaborar este trabajo no existe literatura que reporte el uso de esta técnica para la ...
Un algoritmo de optimización estocástica Con incorporación de información a priori
(2003)
En este documento se desarrolla una algoritmo de busqueda aleatoria con incorporacion de informacion a priori para optimizar algunos modelos de programacion matematica no lineal con estructura estocastica. El algoritmo ...
Transitive behavior in reversible one-dimensional cellular automata with a Welch index 1
(2002)
The problem of knowing and characterizing the transitive behavior of a given cellular automaton is a very interesting topic. This paper provides a matrix representation of the global dynamics in reversible one-dimensional ...
A note about the regular languaje of Rule 110 and its general machine: the scalar subset diagram.
(2007)
As it was published in other papers, a regular language
can be derived in the elemental cellular automaton (ECA)
Rule 110 from a subset of regular expressions produced from its
set of gliders. This way, a full description ...
Areas de oportunidad en el estudio de aut´omatas celulares reversibles
(2011)
Este manuscrito presenta una visi´on general de los resultados m´as relevantes en la investigaci´on que se ha desarrollado en los ´ultimos 40 a?nos en aut´omatas celulares reversibles en una dimensi´on, as´? como
la ...
Gliders in Rule 110
(2006)
The one-dimensional binary cellular automaton numbered Rule 110 in Stephen Wolfram?s system of identification [47] has been an object of special attention due to the structures or gliders1 which have been observed in ...
The Inverse Behavior of a Reversible One-Dimensional Cellular Automaton Obtained by a Single Welch Diagram
(2006)
Reversible cellular automata are discrete dynamical systems based on local interactions which are able to produce an invertible global behavior. Reversible automata have been carefully analyzed by means of graph
and matrix ...