Evolution of Cellular Automata Using Instruction-Based Approach

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F12%3APU101752" target="_blank" >RIV/00216305:26230/12:PU101752 - isvavai.cz</a>

Výsledek na webu

<a href="http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6256475" target="_blank" >http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6256475</a>

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

Evolution of Cellular Automata Using Instruction-Based Approach

Popis výsledku v původním jazyce

This paper introduces a method of encoding cellular automata local transition function using an instruction-based approach and their design by means of genetic algorithms. The proposed method represents an indirect mapping between the input combinationsof states in the cellular neighborhood and the next states of the cells during the development steps. In this case the local transition function is described by a program (algorithm) whose execution calculates the next cell states. The objective of the program-based representation is to reduce the length of the chromosome in case of the evolutionary design of cellular automata. It will be shown that the instruction-based development allows us to design complex cellular automata with higher success ratethan the conventional table-based method especially for complex cellular automata with more than two cell states. The case studies include the replication problem and the problem of development of a given pattern from an initial seed.

Název v anglickém jazyce

Evolution of Cellular Automata Using Instruction-Based Approach

Popis výsledku anglicky

This paper introduces a method of encoding cellular automata local transition function using an instruction-based approach and their design by means of genetic algorithms. The proposed method represents an indirect mapping between the input combinationsof states in the cellular neighborhood and the next states of the cells during the development steps. In this case the local transition function is described by a program (algorithm) whose execution calculates the next cell states. The objective of the program-based representation is to reduce the length of the chromosome in case of the evolutionary design of cellular automata. It will be shown that the instruction-based development allows us to design complex cellular automata with higher success ratethan the conventional table-based method especially for complex cellular automata with more than two cell states. The case studies include the replication problem and the problem of development of a given pattern from an initial seed.

Druh

D - Stať ve sborníku

CEP obor

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

OECD FORD obor

—

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)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2012

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

2012 IEEE World Congress on Computational Intelligence

ISBN

978-1-4673-1508-1

ISSN

—

e-ISSN

—

Počet stran výsledku

8

Strana od-do

1060-1067

Název nakladatele

Institute of Electrical and Electronics Engineers

Místo vydání

CA

Místo konání akce

Brisbane

Datum konání akce

10. 6. 2012

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

WRD - Celosvětová akce

Kód UT WoS článku

000312859302037