Digital repository of Slovenian research organisations

Search the repository
A+ | A- | Help | SLO | ENG

There are two search modes available: simple and advanced. Simple search can include one or more words from the title, summary, keywords or full text, but does not allow the use of search operators. Advanced search allows to limit the number of search results by entering the search terms of different categories in the search window, as well as the use of Boolean search operators (AND, OR and AND NOT). In search results short formats of records are displayed and some data are displayed as links, which open a detailed description of the material (title link) or perform a new search (author or keyword link).

Help
Search in:
Options:
 


131 - 140 / 2000
First pagePrevious page10111213141516171819Next pageLast page
131.
Comparing solvability patterns of algorithms across diverse problem landscapes
Ana Nikolikj, Tome Eftimov, 2024, published scientific conference contribution

Keywords: single-objective optimization, latent representations, explainability
Published in DiRROS: 11.12.2024; Views: 81; Downloads: 35
.pdf Full text (983,48 KB)
This document has many files! More...

132.
Using machine learning methods to assess module performance contribution in modular optimization frameworks
Ana Kostovska, Diederick Vermetten, Peter Korošec, Sašo Džeroski, Carola Doerr, Tome Eftimov, 2024, original scientific article

Abstract: Modular algorithm frameworks not only allow for combinations never tested in manually selected algorithm portfolios, but they also provide a structured approach to assess which algorithmic ideas are crucial for the observed performance of algorithms. In this study, we propose a methodology for analyzing the impact of the different modules on the overall performance. We consider modular frameworks for two widely used families of derivative-free black-box optimization algorithms, the Covariance Matrix Adaptation Evolution Strategy (CMA-ES) and differential evolution (DE). More specifically, we use performance data of 324 modCMA-ES and 576 modDE algorithm variants (with each variant corresponding to a specific configuration of modules) obtained on the 24 BBOB problems for 6 different runtime budgets in 2 dimensions. Our analysis of these data reveals that the impact of individual modules on overall algorithm performance varies significantly. Notably, among the examined modules, the elitism module in CMA-ES and the linear population size reduction module in DE exhibit the most significant impact on performance. Furthermore, our exploratory data analysis of problem landscape data suggests that the most relevant landscape features remain consistent regardless of the configuration of individual modules, but the influence that these features have on regression accuracy varies. In addition, we apply classifiers that exploit feature importance with respect to the trained models for performance prediction and performance data, to predict the modular configurations of CMA-ES and DE algorithm variants. The results show that the predicted configurations do not exhibit a statistically significant difference in performance compared to the true configurations, with the percentage varying depending on the setup (from 49.1% to 95.5% for modCMA and 21.7% to 77.1% for DE)
Keywords: evolutionary computation, modular algorithm frameworks, DE
Published in DiRROS: 11.12.2024; Views: 99; Downloads: 37
.pdf Full text (1,37 MB)
This document has many files! More...

133.
Geometric matching and bottleneck problems
Sergio Cabello, Siu-Wing Cheng, Otfried Cheong, Christian Knauer, 2024, published scientific conference contribution

Abstract: Let $P$ be a set of at most $n$ points and let $R$ be a set of at most $n$ geometric ranges, such as disks or rectangles, where each $p \in P$ has an associated supply $s_{p} > 0$, and each $r \in R$ has an associated demand $d_{r} > 0$. A (many-to-many) matching is a set ${\mathcal A}$ of ordered triples $(p,r,a_{pr}) \in P \times R \times {\mathbb R}_{>0}$ such that $p \in r$ and the $a_{pr}$'s satisfy the constraints given by the supplies and demands. We show how to compute a maximum matching, that is, a matching maximizing $\sum_{(p,r,a_{pr}) \in {\mathcal A}} a_{pr}$. Using our techniques, we can also solve minimum bottleneck problems, such as computing a perfect matching between a set of $n$ red points $P$ and a set of $n$ blue points $Q$ that minimizes the length of the longest edge. For the $L_\infty$-metric, we can do this in time $O(n^{1+\varepsilon})$ in any fixed dimension, for the $L_2$-metric in the plane in time $O(n^{4/3 + \varepsilon})$, for any $\varepsilon > 0$.
Keywords: many-to-many matching, bipartite, planar, geometric matching, approximation
Published in DiRROS: 11.12.2024; Views: 69; Downloads: 29
.pdf Full text (959,05 KB)
This document has many files! More...

134.
135.
Cene gozdnih lesnih sortimentov na slovenskem trgu v juniju 2020
Darja Stare, Špela Ščap, 2020, professional article

Keywords: les, tržne razmere, les
Published in DiRROS: 11.12.2024; Views: 75; Downloads: 22
.pdf Full text (2,25 MB)

136.
Kako bodo Nemci v prihodnje »klasirali« lubadarice?
Mirko Baša, 2020, professional article

Keywords: les, klasifikacija lesa, lubadarice, Nemčija
Published in DiRROS: 11.12.2024; Views: 80; Downloads: 23
.pdf Full text (2,25 MB)

137.
138.
139.
140.
Search done in 0.8 sec.
Back to top