All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

On Routine Evolution of Complex Cellular Automata

The result's identifiers

  • Result code in 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>

  • Result on the web

    <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>

Alternative languages

  • Result language

    angličtina

  • Original language name

    On Routine Evolution of Complex Cellular Automata

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    JC - Computer hardware and software

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GA14-04197S" target="_blank" >GA14-04197S: Advanced Methods for Evolutionary Design of Complex Digital Circuits</a><br>

  • Continuities

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

Others

  • Publication year

    2016

  • Confidentiality

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

Data specific for result type

  • Name of the periodical

    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION

  • ISSN

    1089-778X

  • e-ISSN

  • Volume of the periodical

    20

  • Issue of the periodical within the volume

    5

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    13

  • Pages from-to

    742-754

  • UT code for WoS article

    000385241600007

  • EID of the result in the Scopus database