A method for designing the transition rules ofcellular automata using genetic algorithms is described.Rule-changing cellular automata are expected to performdensity classification tasks more effectively thanordinary cellular automata. We propose a method fordesigning high performance rule-changing cellular automata.This method uses a new parameter that indicatesthe propagation of information. Experimental results fordensity classification tasks show that the proposed methodperforms better than the previous method
Focus of this master's thesis is on evolutionary design of cellular automata and it's optimalization...
This paper introduces a method of encoding cellular automata local transition function using an inst...
The aim of this master thesis is to introduce a new technique for the design of cellular automata wh...
Synthesis of cellular automata is an important area of modeling and describing complex systems. Larg...
We investigate the state change behavior of one-dimensional cellular automata during the solution of...
The Density Classification Task is a well known test problem for two-state discrete dynamical system...
It is difficult to program cellular automata. This is especially true when the desired computation r...
Cellular automata are used in many fields to generate a global behavior with local rules. Finding th...
AbstractThe study of computational aspects of cellular automata (CA) is a recurrent theme being that...
AbstractCellular automata are dynamical systems in which space and time are discrete, that operate a...
The use of a genetic algorithm to obtain "interesting" initial conditions for cellular automata of t...
The density classification problem consists in using a binary cellular automaton (CA) to decide whet...
This bachelor’s thesis aims to examine possibilities of designing a transition function enabli...
This paper presents the comparative results of applying the same genetic algorithm (GA) for the evol...
We review recent work done by our group on applying genetic algorithms (GAs) to the design of cellul...
Focus of this master's thesis is on evolutionary design of cellular automata and it's optimalization...
This paper introduces a method of encoding cellular automata local transition function using an inst...
The aim of this master thesis is to introduce a new technique for the design of cellular automata wh...
Synthesis of cellular automata is an important area of modeling and describing complex systems. Larg...
We investigate the state change behavior of one-dimensional cellular automata during the solution of...
The Density Classification Task is a well known test problem for two-state discrete dynamical system...
It is difficult to program cellular automata. This is especially true when the desired computation r...
Cellular automata are used in many fields to generate a global behavior with local rules. Finding th...
AbstractThe study of computational aspects of cellular automata (CA) is a recurrent theme being that...
AbstractCellular automata are dynamical systems in which space and time are discrete, that operate a...
The use of a genetic algorithm to obtain "interesting" initial conditions for cellular automata of t...
The density classification problem consists in using a binary cellular automaton (CA) to decide whet...
This bachelor’s thesis aims to examine possibilities of designing a transition function enabli...
This paper presents the comparative results of applying the same genetic algorithm (GA) for the evol...
We review recent work done by our group on applying genetic algorithms (GAs) to the design of cellul...
Focus of this master's thesis is on evolutionary design of cellular automata and it's optimalization...
This paper introduces a method of encoding cellular automata local transition function using an inst...
The aim of this master thesis is to introduce a new technique for the design of cellular automata wh...