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:
 


1281 - 1290 / 2000
Na začetekNa prejšnjo stran125126127128129130131132133134Na naslednjo stranNa konec
1281.
Edge-transitive cubic graphs: analysis, cataloguing and enumeration
Marston D. E. Conder, Primož Potočnik, 2026, izvirni znanstveni članek

Povzetek: This paper deals with finite cubic (3-regular) graphs whose automorphism group acts transitively on the edges of the graph. Such graphs split into two broad classes, namely arc-transitive and semisymmetric cubic graphs, and then these divide respectively into 7 types (according to a classification by Djoković and Miller (1980) [17]) and 15 types (according to a classification by Goldschmidt (1980) [23]), in terms of certain group amalgams. Such graphs of small order were previously known up to orders 2048 and 768, respectively, and we have extended each of the two lists of all such graphs up to order 10000. Before describing how we did that, we carry out an analysis of the 22 amalgams, to show which of the finitely-presented groups associated with the 15 Goldschmidt amalgams can be faithfully embedded in one or more of the other 21 (as subgroups of finite index), complementing what is already known about such embeddings of the 7 Djoković-Miller groups in each other. We also give an example of a graph of each of the 22 types, and in most cases, describe the smallest such graph, and we then use regular coverings to prove that there are infinitely many examples of each type. Finally, we discuss the asymptotic enumeration of the graph orders, proving that if $f_{\mathcal C}(n)$ is the number of cubic edge-transitive graphs of type ${\mathcal C}$ on at most $n$ vertices, then there exist positive real constants $a$ and $b$ and a positive integer $n_0$ such that $n^{a \log(n)} \le f_{\mathcal C}(n) \le n^{b \log(n)}$ for all $n\ge 0$.
Ključne besede: groups, graphs, symmetry, amalgams, cover
Objavljeno v DiRROS: 21.08.2025; Ogledov: 258; Prenosov: 132
.pdf Celotno besedilo (1,64 MB)
Gradivo ima več datotek! Več...

1282.
1283.
1284.
1285.
Comparing optimization algorithms through the lens of search behavior analysis
Gjorgjina Cenikj, Gašper Petelin, Tome Eftimov, 2025, objavljeni znanstveni prispevek na konferenci

Ključne besede: black-box single-objective numerical optimization, optimization algorithm analysis
Objavljeno v DiRROS: 20.08.2025; Ogledov: 358; Prenosov: 185
.pdf Celotno besedilo (2,41 MB)
Gradivo ima več datotek! Več...

1286.
1287.
Customized exploration of landscape features driving multi-objective combinatorial optimization performance
Ana Nikolikj, Gabriela Ochoa, Tome Eftimov, 2025, objavljeni znanstveni prispevek na konferenci

Ključne besede: landscape analysis, multi-objective combinatorial optimization, feature importance
Objavljeno v DiRROS: 20.08.2025; Ogledov: 377; Prenosov: 188
.pdf Celotno besedilo (2,88 MB)
Gradivo ima več datotek! Več...

1288.
Hybrid polymer composite of abaca-E-glass and epoxy-bamboo activated carbon nanofiller with variations in fiber orientation
L. Banowati, N. Chitraningrum, 2025, izvirni znanstveni članek

Ključne besede: hybrid, abaca, E-glass, nanofiller, epoxy, bamboo-activated carbon
Objavljeno v DiRROS: 20.08.2025; Ogledov: 403; Prenosov: 181
.pdf Celotno besedilo (1,89 MB)
Gradivo ima več datotek! Več...

1289.
Adaptive estimation of the number of algorithm runs in stochastic optimization
Tome Eftimov, Peter Korošec, 2025, objavljeni znanstveni prispevek na konferenci

Ključne besede: experimental design, number of runs, stochastic optimization algorithms
Objavljeno v DiRROS: 20.08.2025; Ogledov: 350; Prenosov: 178
.pdf Celotno besedilo (1,96 MB)
Gradivo ima več datotek! Več...

1290.
Iskanje izvedeno v 1.65 sek.
Na vrh