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:
 


1971 - 1980 / 2000
First pagePrevious page191192193194195196197198199200Next pageLast page
1971.
Catalytic hydrogenation reaction micro-kinetic model for dibenzyltoluene as liquid organic hydrogen carrier
Aleksandra Tomić, Brett Pomeroy, Branislav Todić, Blaž Likozar, Nikola Nikačević, 2024, original scientific article

Published in DiRROS: 21.05.2024; Views: 546; Downloads: 1020
.pdf Full text (3,07 MB)
This document has many files! More...

1972.
1973.
1974.
1975.
Prva skupna konferenca Alpske in Karpatske konvencije o upravljanju velikih zveri
Vesna Mihelič Oražem, Boris Rantaša, 2024, popular article

Keywords: velike zveri, posvetovanja
Published in DiRROS: 21.05.2024; Views: 593; Downloads: 97
.pdf Full text (214,89 KB)

1976.
1977.
Nagradni stripovski natečaj Gozd in podnebne spremembe
Simon Zidar, Anica Simčič, Andreja Ferreira, Boštjan Mali, 2024, popular article

Keywords: gozdarstvo, natečaji, stripi
Published in DiRROS: 21.05.2024; Views: 554; Downloads: 88
.pdf Full text (159,69 KB)

1978.
A cross-benchmark examination of feature-based algorithm selector generalization in single-objective numerical optimization
Gjorgjina Cenikj, Gašper Petelin, Tome Eftimov, 2024, original scientific article

Abstract: The task of selecting the best optimization algorithm for a particular problem is known as algorithm selection (AS). This involves training a model using landscape characteristics to predict algorithm performance, but a key challenge remains: making AS models generalize effectively to new, untrained benchmark suites. This study assesses AS models’ generalizability in single-objective numerical optimization across diverse benchmark suites. Using Exploratory Landscape Analysis (ELA) and transformer-based (TransOpt) features, the research investigates their individual and combined effectiveness in AS across four benchmarks: BBOB, AFFINE, RANDOM, and ZIGZAG. AS models perform differently based on benchmark suite similarities in algorithm performance distributions and single-best solvers. When suites align, these models underperform against a baseline predicting mean algorithm performance; yet, they outperform the baseline when suites differ in performance distributions and solvers. The AS models trained using the ELA landscape features are better than the models trained using the TransOpt features on the BBOB and AFFINE benchmark suites, while the opposite is true for the RANDOM benchmark suite. Ultimately, the study reveals challenges in accurately capturing algorithm performance through problem landscape features (ELA or TransOpt), impacting AS model applicability.
Keywords: algorithm selection, multi-target regression, generalization, benchmarking
Published in DiRROS: 21.05.2024; Views: 531; Downloads: 536
.pdf Full text (2,49 MB)
This document has many files! More...

1979.
Gozdarske smučarske prireditve v zimi 2023- 2024
Janez Konečnik, 2024, popular article

Keywords: gozdarska tekmovanja, gozdarska smučarska temovanja
Published in DiRROS: 21.05.2024; Views: 636; Downloads: 78
.pdf Full text (587,66 KB)

1980.
2. delavnica javne gozdarske službe na temo gozdnega semenarstva in drevesničarstva
Boris Rantaša, 2024, popular article

Keywords: drevesničarstvo, semenarstvo, javna gozdarska služba
Published in DiRROS: 21.05.2024; Views: 553; Downloads: 71
.pdf Full text (141,18 KB)

Search done in 0.62 sec.
Back to top