Grammatical Evolution with Bidirectional Representation

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F03%3A03087155" target="_blank" >RIV/68407700:21230/03:03087155 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Grammatical Evolution with Bidirectional Representation

Popis výsledku v původním jazyce

Grammatical evolution is an evolutionary algorithm designed to evolve programs in any language. Grammatical evolution operates on binary strings and the mapping of the genotype onto the phenotype (the tree representation of the programs) is provided through the grammar described in the form of production rules. The program trees are constructed in a pre-order fashion, which means that as the genome is traversed first the left most branch of the tree is completed then the second from the left one etc. Once two individuals are crossed over by means of simple one-point crossover the tail parts of the chromosomes (originally encoding the structures on the right side of the program tree) may map on different program structures within the new context. Here we present a bidirectional representation which helps to equalize the survival rate of both the program structures appearing on the left and right side of the program parse tree.

Název v anglickém jazyce

Grammatical Evolution with Bidirectional Representation

Popis výsledku anglicky

Grammatical evolution is an evolutionary algorithm designed to evolve programs in any language. Grammatical evolution operates on binary strings and the mapping of the genotype onto the phenotype (the tree representation of the programs) is provided through the grammar described in the form of production rules. The program trees are constructed in a pre-order fashion, which means that as the genome is traversed first the left most branch of the tree is completed then the second from the left one etc. Once two individuals are crossed over by means of simple one-point crossover the tail parts of the chromosomes (originally encoding the structures on the right side of the program tree) may map on different program structures within the new context. Here we present a bidirectional representation which helps to equalize the survival rate of both the program structures appearing on the left and right side of the program parse tree.

Druh

D - Stať ve sborníku

CEP obor

JC - Počítačový hardware a software

OECD FORD obor

—

Projekt

<a href="/cs/project/GA102%2F02%2F0132" target="_blank" >GA102/02/0132: Využití genetických principů v evolučních algoritmech</a><br>

Návaznosti

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

Rok uplatnění

2003

Kód důvěrnosti údajů

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

Název statě ve sborníku

Genetic Programming, Proceedings of EuroGP'2003

ISBN

3-540-00971-X

ISSN

—

e-ISSN

—

Počet stran výsledku

10

Strana od-do

354-363

Název nakladatele

Springer

Místo vydání

Berlin

Místo konání akce

University of Essex

Datum konání akce

14. 4. 2003

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—