Evolution of Generic Square Calculations in Cellular Automata

Kód výsledku v IS VaVaI

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

Výsledek na webu

<a href="http://www.scitepress.org/DigitalLibrary/PublicationsDetail.aspx?ID=fUDdabZdceo=&t=1" target="_blank" >http://www.scitepress.org/DigitalLibrary/PublicationsDetail.aspx?ID=fUDdabZdceo=&t=1</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.5220/0006064800940102" target="_blank" >10.5220/0006064800940102</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Evolution of Generic Square Calculations in Cellular Automata

Popis výsledku v původním jazyce

The paper deals with the design of uniform multi-state one-dimensional cellular automata using an evolutionary algorithm and their application to solve the problem of generic square calculations. The key idea is based on the representation of the transition functions for the automata, which utilises the concept of conditionally matching rules. This technique allows us to design complex cellular automata for which the conventional representations have failed. A study is proposed with various settings of the experimental system, which concerns the way of evaluating the candidate solutions, the number of cell states and the number of conditional rules of the transition functions. It is shown that various generic solutions for the square calculation can be obtained in one-dimensional cellular automata using local interactions of cells only. The results presented demonstrates an ability of the evolution to discover innovative solutions both from the view of complexity of the cellular autom aton and the number of steps needed to calculate the results in comparison with the known solution.

Název v anglickém jazyce

Evolution of Generic Square Calculations in Cellular Automata

Popis výsledku anglicky

The paper deals with the design of uniform multi-state one-dimensional cellular automata using an evolutionary algorithm and their application to solve the problem of generic square calculations. The key idea is based on the representation of the transition functions for the automata, which utilises the concept of conditionally matching rules. This technique allows us to design complex cellular automata for which the conventional representations have failed. A study is proposed with various settings of the experimental system, which concerns the way of evaluating the candidate solutions, the number of cell states and the number of conditional rules of the transition functions. It is shown that various generic solutions for the square calculation can be obtained in one-dimensional cellular automata using local interactions of cells only. The results presented demonstrates an ability of the evolution to discover innovative solutions both from the view of complexity of the cellular autom aton and the number of steps needed to calculate the results in comparison with the known solution.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

20206 - Computer hardware and architecture

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í

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

Proceedings of the 8th International Joint Conference on Computational Intelligence - Volume 3: ECTA

ISBN

978-989-758-201-1

ISSN

—

e-ISSN

—

Počet stran výsledku

9

Strana od-do

94-102

Název nakladatele

SciTePress - Science and Technology Publications

Místo vydání

Porto

Místo konání akce

Porto

Datum konání akce

11. 9. 2016

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

WRD - Celosvětová akce

Kód UT WoS článku

000393153900009