Syntéza Boolean Parity Funkce jakýmkoliv evolučním algoritmem - komparativní studie

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F70883521%3A28110%2F04%3A63502387" target="_blank" >RIV/70883521:28110/04:63502387 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Boolean Parity Function Synthesis by Means of Arbitrary Evoutionary Algorithms - Comparative Study

Popis výsledku v původním jazyce

This contribution is introducing novelty method which allows to solve various problems from symbolic regression domain. An idea of symbolic regression was firstly proposed by J. R. Koza in so called genetic programming and by C. Ryan in grammatical evolution. In this contribution main principles of analytic programming are described and explained, including some demonstration of its ability to synthesise suitable solutions called programs as well as in genetic programming or grammatical evolution. A comparative study was also carried out. This comparative study is concerned to Boolean even-3-parity problems from Koza's genetic programming which are solved by means of analytical programming applied by means of four evolutionary algorithms: simulated annealing, genetic algorithm, differential evolution and self-organizing migrating algorithm.

Název v anglickém jazyce

Boolean Parity Function Synthesis by Means of Arbitrary Evoutionary Algorithms - Comparative Study

Popis výsledku anglicky

This contribution is introducing novelty method which allows to solve various problems from symbolic regression domain. An idea of symbolic regression was firstly proposed by J. R. Koza in so called genetic programming and by C. Ryan in grammatical evolution. In this contribution main principles of analytic programming are described and explained, including some demonstration of its ability to synthesise suitable solutions called programs as well as in genetic programming or grammatical evolution. A comparative study was also carried out. This comparative study is concerned to Boolean even-3-parity problems from Koza's genetic programming which are solved by means of analytical programming applied by means of four evolutionary algorithms: simulated annealing, genetic algorithm, differential evolution and self-organizing migrating algorithm.

Druh

D - Stať ve sborníku

CEP obor

JD - Využití počítačů, robotika a její aplikace

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

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

Rok uplatnění

2004

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

SCI 2004

ISBN

980-6560-13-2

ISSN

—

e-ISSN

—

Počet stran výsledku

6

Strana od-do

231-236

Název nakladatele

SCI 2004

Místo vydání

Orlando

Místo konání akce

Orlando, USA

Datum konání akce

18. 7. 2004

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

WRD - Celosvětová akce

Kód UT WoS článku

—