On Routine Evolution of Complex Cellular Automata

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F16%3APU121680" target="_blank" >RIV/00216305:26230/16:PU121680 - isvavai.cz</a>

Výsledek na webu

<a href="http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7377086" target="_blank" >http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7377086</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/TEVC.2016.2516242" target="_blank" >10.1109/TEVC.2016.2516242</a>

Jazyk výsledku

angličtina

Název v původním jazyce

On Routine Evolution of Complex Cellular Automata

Popis výsledku v původním jazyce

The paper deals with a special technique, called conditionally matching rules, for the representation of transition functions of cellular automata and its application to the evolutionary design of complex multi-state cellular automata. The problem of designing replicating loops in two-dimensional cellular automata and the square calculation in one-dimensional cellular automata will be treated as case studies. It will be shown that the evolutionary algorithm in combination with conditionally matching rules is able to successfully solve these tasks and provide some innovative results compared to existing solutions. In particular, a novel replication scheme will be presented that exhibits a higher replication speed in comparison with the existing replicating loops. As regards the square calculation, some results have been obtained that allow a substantial reduction of the number of steps of the cellular automaton against the currently known solution. The utilisation of the conditionally matching rules in the proposed experiments represents the first case of a successful automatic evolutionary design of complex cellular automata for solving non-trivial problems in which the existing conventional approaches have failed.

Název v anglickém jazyce

On Routine Evolution of Complex Cellular Automata

Popis výsledku anglicky

The paper deals with a special technique, called conditionally matching rules, for the representation of transition functions of cellular automata and its application to the evolutionary design of complex multi-state cellular automata. The problem of designing replicating loops in two-dimensional cellular automata and the square calculation in one-dimensional cellular automata will be treated as case studies. It will be shown that the evolutionary algorithm in combination with conditionally matching rules is able to successfully solve these tasks and provide some innovative results compared to existing solutions. In particular, a novel replication scheme will be presented that exhibits a higher replication speed in comparison with the existing replicating loops. As regards the square calculation, some results have been obtained that allow a substantial reduction of the number of steps of the cellular automaton against the currently known solution. The utilisation of the conditionally matching rules in the proposed experiments represents the first case of a successful automatic evolutionary design of complex cellular automata for solving non-trivial problems in which the existing conventional approaches have failed.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

JC - Počítačový hardware a software

OECD FORD obor

—

Projekt

<a href="/cs/project/GA14-04197S" target="_blank" >GA14-04197S: Pokročilé metody evolučního návrhu složitých číslicových obvodů</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2016

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION

ISSN

1089-778X

e-ISSN

—

Svazek periodika

20

Číslo periodika v rámci svazku

5

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

13

Strana od-do

742-754

Kód UT WoS článku

000385241600007

EID výsledku v databázi Scopus

—