( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Configuration Balancing for Stochastic Requests.

, , , , и . IPCO, том 13904 из Lecture Notes in Computer Science, стр. 127-141. Springer, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Franziska Carola Eberle

Gerhard Eberle

Heinz Eberle

Hansherbert Eberle

Max Eberle

 

Другие публикации лиц с тем же именем

Speed-Robust Scheduling., , , , , и . CoRR, (2020)Speed-Robust Scheduling - Sand, Bricks, and Rocks., , , , , и . IPCO, том 12707 из Lecture Notes in Computer Science, стр. 283-296. Springer, (2021)Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time., , , , и . FSTTCS, том 213 из LIPIcs, стр. 18:1-18:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Speed-robust scheduling: sand, bricks, and rocks., , , , , и . Math. Program., 197 (2): 1009-1048 (февраля 2023)Configuration Balancing for Stochastic Requests., , , , и . CoRR, (2022)Configuration Balancing for Stochastic Requests., , , , и . IPCO, том 13904 из Lecture Notes in Computer Science, стр. 127-141. Springer, (2023)Optimally handling commitment issues in online throughput maximization.. ISAIM, (2022)O(1/ε) Is the Answer in Online Weighted Throughput Maximization.. STACS, том 289 из LIPIcs, стр. 32:1-32:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)A General Framework for Handling Commitment in Online Throughput Maximization., , , , и . IPCO, том 11480 из Lecture Notes in Computer Science, стр. 141-154. Springer, (2019)A general framework for handling commitment in online throughput maximization., , , , и . CoRR, (2018)