|
11 |
A Comparative Study of Compressed, Learned, and Traditional Indexing Methods for Integer Data
Bellomo, Lorenzo. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
12 |
A comparative study of multi-objective and neuroevolutionary-based reinforcement learning algorithms for optimizing electric vehicle charging and load management
Kemper, Neele. - Augsburg : Universität Augsburg, 2025
|
|
|
|
13 |
A Deterministic Partition Tree and Applications
Wang, Haitao. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
14 |
A DSL for Swarm Intelligence Algorithms
Martins, Kevin. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
15 |
A Dynamic Piecewise-Linear Geometric Index with Worst-Case Guarantees
Gæde, Emil Toftegaard. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
16 |
A Fast and Simple Algorithm for the Resource Constrained Shortest Path Problem
Ahmadi, Saman. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
17 |
A Fast Coloring Oracle for Average Case Hypergraphs
Marcussen, Cassandra. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
18 |
A Faster Parametric Search for the Integral Quickest Transshipment Problem
Anapolska, Mariia. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
19 |
A Formal Analysis of Algorithms for Matroids and Greedoids
Abdulaziz, Mohammad. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
20 |
A k-mer-Based Estimator of the Substitution Rate Between Repetitive Sequences
Wu, Haonan. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
Administration
