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”

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

The result's identifiers

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

  • Result on the web

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

Alternative languages

  • Result language

    angličtina

  • Original language name

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

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

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

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

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

Others

  • Publication year

    2015

  • 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

  • Article name in the collection

    2015 IEEE International Conference on Evolvable Systems (ICES)

  • ISBN

    978-1-4799-7560-0

  • ISSN

  • e-ISSN

  • Number of pages

    8

  • Pages from-to

    1506-1513

  • Publisher name

    IEEE Computational Intelligence Society

  • Place of publication

    Cape Town

  • Event location

    Cape Town

  • Event date

    Dec 7, 2015

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000380431500206