Digitalni repozitorij raziskovalnih organizacij Slovenije

Iskanje po repozitoriju
A+ | A- | Pomoč | SLO | ENG

Na voljo sta dva načina iskanja: enostavno in napredno. Enostavno iskanje lahko zajema niz več besed iz naslova, povzetka, ključnih besed, celotnega besedila in avtorja, zaenkrat pa ne omogoča uporabe operatorjev iskanja. Napredno iskanje omogoča omejevanje števila rezultatov iskanja z vnosom iskalnih pojmov različnih kategorij v iskalna okna in uporabo logičnih operatorjev (IN, ALI ter IN NE). V rezultatih iskanja se izpišejo krajši zapisi podatkov o gradivu, ki vsebujejo različne povezave, ki omogočajo vpogled v podroben opis gradiva (povezava iz naslova) ali sprožijo novo iskanje (po avtorjih ali ključnih besedah).

Pomoč
Išči po:
Možnosti:
 


131 - 140 / 2000
Na začetekNa prejšnjo stran10111213141516171819Na naslednjo stranNa konec
131.
Comparing solvability patterns of algorithms across diverse problem landscapes
Ana Nikolikj, Tome Eftimov, 2024, objavljeni znanstveni prispevek na konferenci

Ključne besede: single-objective optimization, latent representations, explainability
Objavljeno v DiRROS: 11.12.2024; Ogledov: 81; Prenosov: 35
.pdf Celotno besedilo (983,48 KB)
Gradivo ima več datotek! Več...

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, izvirni znanstveni članek

Povzetek: 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)
Ključne besede: evolutionary computation, modular algorithm frameworks, DE
Objavljeno v DiRROS: 11.12.2024; Ogledov: 99; Prenosov: 37
.pdf Celotno besedilo (1,37 MB)
Gradivo ima več datotek! Več...

133.
Geometric matching and bottleneck problems
Sergio Cabello, Siu-Wing Cheng, Otfried Cheong, Christian Knauer, 2024, objavljeni znanstveni prispevek na konferenci

Povzetek: 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$.
Ključne besede: many-to-many matching, bipartite, planar, geometric matching, approximation
Objavljeno v DiRROS: 11.12.2024; Ogledov: 69; Prenosov: 29
.pdf Celotno besedilo (959,05 KB)
Gradivo ima več datotek! Več...

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

Ključne besede: les, tržne razmere, les
Objavljeno v DiRROS: 11.12.2024; Ogledov: 75; Prenosov: 22
.pdf Celotno besedilo (2,25 MB)

136.
Kako bodo Nemci v prihodnje »klasirali« lubadarice?
Mirko Baša, 2020, strokovni članek

Ključne besede: les, klasifikacija lesa, lubadarice, Nemčija
Objavljeno v DiRROS: 11.12.2024; Ogledov: 80; Prenosov: 23
.pdf Celotno besedilo (2,25 MB)

137.
138.
139.
140.
Iskanje izvedeno v 0.63 sek.
Na vrh