|
31 |
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
|
|
|
|
32 |
Stochastic Graph Exploration
Anagnostōpulos, Arēs. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2019
|
|
|
|
33 |
Stochastic Online Metric Matching
Gupta, Anupam. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2019
|
|
|
|
34 |
A PTAS for a Class of Stochastic Dynamic Programs
Fu, Hao. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018
|
|
|
|
35 |
On stability in multiobjective programming - a stochastic approach
Vogel, Silvia. - Ilmenau : Universitätsbibliothek Ilmenau, 2018
|
|
|
|
36 |
Stability results for stochastic programming problems
Vogel, Silvia. - Ilmenau : Universitätsbibliothek Ilmenau, 2018
|
|
|
37 |
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
|
|
|
|
38 |
A randomized method for handling a difficult function in a convex optimization problem, motivated by probabilistic programming
Fábián, Csaba I.. - Berlin : Humboldt-Universität zu Berlin, 2017
|
|
|
|
39 |
Learning Enabled Optimization: Towards a Fusion of Statistical Learning and Stochastic Optimization
Sen, Suvrajeet. - Berlin : Humboldt-Universität zu Berlin, 2017
|
|
|
|
40 |
Optimal scenario generation and reduction in stochastic programming
Henrion, René. - Berlin : Humboldt-Universität zu Berlin, 2017
|
|
Administration
