About: Evolution of Computational Structures in Uniform Cellular Automata     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
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 exp
  • 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 exp (en)
Title
  • Evolution of Computational Structures in Uniform Cellular Automata
  • Evolution of Computational Structures in Uniform Cellular Automata (en)
skos:prefLabel
  • Evolution of Computational Structures in Uniform Cellular Automata
  • Evolution of Computational Structures in Uniform Cellular Automata (en)
skos:notation
  • RIV/00216305:26230/14:PU111930!RIV15-MSM-26230___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(ED1.1.00/02.0070), P(GA14-04197S)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 15569
http://linked.open...ai/riv/idVysledku
  • RIV/00216305:26230/14:PU111930
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Genetic algorithm, cellular automaton, transition function, conditionally matching rule, multiplication, emergent behavior. (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [7B3DF8541966]
http://linked.open...v/mistoKonaniAkce
  • Beijing
http://linked.open...i/riv/mistoVydani
  • Beijing
http://linked.open...i/riv/nazevZdroje
  • 2014 IEEE Congress on Evolutionary Computation (CEC)
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Bidlo, Michal
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
number of pages
http://bibframe.org/vocab/doi
  • 10.1109/CEC.2014.6900530
http://purl.org/ne...btex#hasPublisher
  • IEEE Computational Intelligence Society
https://schema.org/isbn
  • 978-1-4799-1488-3
http://localhost/t...ganizacniJednotka
  • 26230
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software