Investigation of Replicating Tiles in Cellular Automata Designed by Evolution Using Conditionally Matching Rules

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F15%3APU117024" target="_blank" >RIV/00216305:26230/15:PU117024 - isvavai.cz</a>

Výsledek na webu

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

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

Investigation of Replicating Tiles in Cellular Automata Designed by Evolution Using Conditionally Matching Rules

Popis výsledku v původním jazyce

In this paper we investigate the evolutionary design of replicating tiles in cellular automata. In particular, various sizes of the tiles will be considered whose replication ought to be performed by satisfying a given arrangement of the tiles with respect to each other. The goal is to determine the abilities of the genetic algorithm in combination with conditionally matching rules used for representing the transition functions of cellular automata to find solutions for tiles consisting of up to a hundred of cells. A comparative study will be presented considering the success rate, computational effort and complexity of the obtained solutions as the main values of interest. It will be shown that, in addition to the tile size and the number of states of the cellular automaton, the probability of finding a correct solution is also substantially influenced by the arrangement style. The results show that the tile arrangement that may be considered as the simplest one does not have to necessarily be easily realisable by the genetic algorithm as a transition function for a cellular automaton.

Název v anglickém jazyce

Investigation of Replicating Tiles in Cellular Automata Designed by Evolution Using Conditionally Matching Rules

Popis výsledku anglicky

In this paper we investigate the evolutionary design of replicating tiles in cellular automata. In particular, various sizes of the tiles will be considered whose replication ought to be performed by satisfying a given arrangement of the tiles with respect to each other. The goal is to determine the abilities of the genetic algorithm in combination with conditionally matching rules used for representing the transition functions of cellular automata to find solutions for tiles consisting of up to a hundred of cells. A comparative study will be presented considering the success rate, computational effort and complexity of the obtained solutions as the main values of interest. It will be shown that, in addition to the tile size and the number of states of the cellular automaton, the probability of finding a correct solution is also substantially influenced by the arrangement style. The results show that the tile arrangement that may be considered as the simplest one does not have to necessarily be easily realisable by the genetic algorithm as a transition function for a cellular automaton.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

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

Rok uplatnění

2015

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 statě ve sborníku

2015 IEEE International Conference on Evolvable Systems (ICES)

ISBN

978-1-4799-7560-0

ISSN

—

e-ISSN

—

Počet stran výsledku

8

Strana od-do

1506-1513

Název nakladatele

IEEE Computational Intelligence Society

Místo vydání

Cape Town

Místo konání akce

Cape Town

Datum konání akce

7. 12. 2015

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

000380431500206