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”

Evolution of Computational Structures in Uniform Cellular Automata

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F14%3APU111930" target="_blank" >RIV/00216305:26230/14:PU111930 - isvavai.cz</a>

  • Result on the web

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

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    Evolution of Computational Structures in Uniform Cellular Automata

  • Original language description

    In this paper we present an approach for evolutionary design of computational processes in two-dimensional uniform binary cellular automata. A special representation technique called conditionally matching rules will be utilized to encode the transition functions of the cellular automata. The principle of the computational process in a cellular automaton is to interpret some cells as input bits some (possibly other) cells as output bits (i.e. the result) of the computation. The goal is to find using genetic algorithm a suitable transition function according to which a specific computation could be observed during the development of the cellular atuomation for all the possible binary combinations stored in the input cells. Both the input values and the result is represented by the state values of the cells. The input of the computation will be represented by the initial state of the cellular automaton. After a finite number of development steps the cells representing the output bits are expexted to contain the result of computation. It will be shown that non-trivial computations can be realized in uniform two-dimensional cellular array. In the experiments presented in this paper some different setups of conditionally matching rules and arrangement of the input and output cells will be investigated.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    20206 - Computer hardware and architecture

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

    2014

  • 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

    2014 IEEE Congress on Evolutionary Computation (CEC)

  • ISBN

    978-1-4799-1488-3

  • ISSN

  • e-ISSN

  • Number of pages

    8

  • Pages from-to

    2732-2739

  • Publisher name

    IEEE Computational Intelligence Society

  • Place of publication

    Beijing

  • Event location

    Beijing

  • Event date

    Jul 6, 2014

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000356684604001