About: Creating evolutionary algorithms by means of analytic programming - design of new cost function     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
  • Příspěvek se zabývá novou myšlenkou jak vytvořit evoluční algoritmy pomocí symbolické regrese a Analytického programování. Motivací nebylo pouze zlepšit stávající algoritmy, ale také najít nové robustní. V této studii byly použity operátory Diferenciální evoluce, Samoorganizujícího se migračního algoritmu a horolezeckého algoritmu pro procesy prováděné Analytickým programováním. Výsledky ukázaly, že je možné nalézt nejen originální algoritmy ale také nové struktury. (cs)
  • This contribution deals with a new idea of how to crate evolutionary algorithms by means of symbolic regression and Analytic Programming. The motivation was not only to tune some existing algorithms to their better performance, but also to find a new robust evolutionary algorithms. In this study operators of Differential Evolution (DE), Self-Organizing Migrating Algorithms (SOMA), Hill Climbing were used during a process of Analytic Programming. The results showed that AP was able to find the originally defined DE but also new structure which has a similar behaviour but slower cnvergence in multimodal function than DE. This, in futher work, leads to including the conditions of convergence to Cost Fucntion. Results produced in 100 repeated simulations are displayed in graphical and tabular form.
  • This contribution deals with a new idea of how to crate evolutionary algorithms by means of symbolic regression and Analytic Programming. The motivation was not only to tune some existing algorithms to their better performance, but also to find a new robust evolutionary algorithms. In this study operators of Differential Evolution (DE), Self-Organizing Migrating Algorithms (SOMA), Hill Climbing were used during a process of Analytic Programming. The results showed that AP was able to find the originally defined DE but also new structure which has a similar behaviour but slower cnvergence in multimodal function than DE. This, in futher work, leads to including the conditions of convergence to Cost Fucntion. Results produced in 100 repeated simulations are displayed in graphical and tabular form. (en)
Title
  • Creating evolutionary algorithms by means of analytic programming - design of new cost function
  • Synteza evolucnich algoritmu pomoci symbolicke regrese - design nove ucelove funkce (cs)
  • Creating evolutionary algorithms by means of analytic programming - design of new cost function (en)
skos:prefLabel
  • Creating evolutionary algorithms by means of analytic programming - design of new cost function
  • Synteza evolucnich algoritmu pomoci symbolicke regrese - design nove ucelove funkce (cs)
  • Creating evolutionary algorithms by means of analytic programming - design of new cost function (en)
skos:notation
  • RIV/70883521:28140/07:63505864!RIV08-MSM-28140___
http://linked.open.../vavai/riv/strany
  • 271-276
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GA102/05/0271), P(GA102/06/1132), Z(MSM7088352101)
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
  • 415235
http://linked.open...ai/riv/idVysledku
  • RIV/70883521:28140/07:63505864
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Evolutionary algorithms; symbolic regression; Ananyltic Programming; Self-Organizing Migrating Algorithm; Hill-Climbing; Differential Evolution (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [27D874B4381B]
http://linked.open...i/riv/mistoVydani
  • Germany
http://linked.open...i/riv/nazevZdroje
  • ECMS 2007
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
  • Oplatková, Zuzana
  • Zelinka, Ivan
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • European Council for Modelling and Simulation
https://schema.org/isbn
  • 978-0-9553018-2-7
http://localhost/t...ganizacniJednotka
  • 28140
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, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software