|
21 |
Stochastic Dynamic Programming with Non-linear Discounting
Enthalten in Applied mathematics & optimization 23.12.2020: 1-30
|
|
|
22 |
How Fast Can We Reach a Target Vertex in Stochastic Temporal Graphs?
Akrida, Eleni C.. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2019
|
|
|
|
23 |
Reachability for Branching Concurrent Stochastic Games (Track B: Automata, Logic, Semantics, and Theory of Programming)
Etessami, Kousha. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2019
|
|
|
|
24 |
Stochastic Graph Exploration
Anagnostōpulos, Arēs. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2019
|
|
|
|
25 |
Stochastic Online Metric Matching
Gupta, Anupam. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2019
|
|
|
|
26 |
A PTAS for a Class of Stochastic Dynamic Programs
Fu, Hao. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018
|
|
|
|
27 |
Combining two-stage stochastic programming and recoverable robustness to minimize the number of late jobs in the case of uncertain processing times
Enthalten in Journal of scheduling 19.2.2018: 1-11
|
|
|
|
28 |
Randomized Load Balancing on Networks with Stochastic Inputs
Cai, Leran. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2017
|
|
|
|
29 |
Stochastic Control via Entropy Compression
Achlioptas, Dimitris. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2017
|
|
|
|
30 |
Stochastic k-Server: How Should Uber Work?
Dehghani, Sina. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2017
|
|
Administration
