Comparison of Cauchy EDA and pPOEMS algorithms on the BBOB noiseless testbed
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F10%3A00171032" target="_blank" >RIV/68407700:21230/10:00171032 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Comparison of Cauchy EDA and pPOEMS algorithms on the BBOB noiseless testbed
Original language description
Estimation of distribution algorithm using Cauchy sampling distribution is compared with the iterative prototype optimization algorithm with evolved improvement steps. While Cauchy EDA is better on unimodal functions, iterative prototype optimization ismore suitable for multimodal functions. This paper compares the results for both algorithms in more detail and adds to the understanding of their key features and differences.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GP102%2F08%2FP094" target="_blank" >GP102/08/P094: Machine learning methods for solution construction in evolutionary algorithms</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2010
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
Proceedings of the 12th annual conference comp on Genetic and evolutionary computation
ISBN
978-1-4503-0073-5
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
—
Publisher name
ACM
Place of publication
New York
Event location
Portland, Oregon
Event date
Jul 7, 2010
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—