Quantile and mean value measures of search process complexity

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21340%2F18%3A00326821" target="_blank" >RIV/68407700:21340/18:00326821 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/s10878-018-0251-4" target="_blank" >http://dx.doi.org/10.1007/s10878-018-0251-4</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s10878-018-0251-4" target="_blank" >10.1007/s10878-018-0251-4</a>

Result language
angličtina
Original language name
Quantile and mean value measures of search process complexity
Original language description
Performance measures of metaheuristic algorithms assess the quality of a search process by statistically analysing its performance. Such criteria serve two purposes: they provide the verdict on which algorithm is better for what task, and they help applying an algorithm on a given task in the most effective way. The latter goal may be achieved by an appropriate restart strategy of the search process. Furthermore, these criteria are traditionally based on analysis of the search step mean value. Our aim is to elaborate the mean value analysis as well, but via a novel and more general quantile-based analytic approach, which can be used to define new measures. We prove and demonstrate this purpose on three quantile-based performance measures.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
—
Continuities
S - Specificky vyzkum na vysokych skolach<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

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

Similar results(10)