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”

Graph-based Genetic Programming

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F22%3APU146650" target="_blank" >RIV/00216305:26230/22:PU146650 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1145/3520304.3533657" target="_blank" >http://dx.doi.org/10.1145/3520304.3533657</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1145/3520304.3533657" target="_blank" >10.1145/3520304.3533657</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Graph-based Genetic Programming

  • Original language description

    Although the classical way to represent programs in Genetic Programming (GP) is by means of an expression tree, different GP variants with alternative representations have been proposed throughout the years. One such representation is the Directed Acyclic Graph (DAG), adopted by methods like Cartesian Genetic Programming (CGP), Linear Genetic Programming (LGP), Parallel Distributed Genetic Programming (PDGP), and, more recently, Evolving Graphs by Graph Programming (EGGP). The aim of this tutorial is to consider this methods from a unified perspective as graph-based GP, present their historical background, representation features, operators, applications, and available implementations.

  • 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

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2022

  • 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

    GECCO 2022 Companion - Proceedings of the 2022 Genetic and Evolutionary Computation Conference

  • ISBN

    978-1-4503-9268-6

  • ISSN

  • e-ISSN

  • Number of pages

    25

  • Pages from-to

    958-982

  • Publisher name

    Association for Computing Machinery

  • Place of publication

    Boston

  • Event location

    Boston

  • Event date

    Jul 9, 2022

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article