Robust optimization in the presence of uncertainty
From MaRDI portal
Publication:2986897
DOI10.1145/2422436.2422491zbMath1362.68256OpenAlexW1986511870MaRDI QIDQ2986897
Matúš Mihalák, Joachim M. Buhmann, Rastislav Šrámek, Peter Widmayer
Publication date: 16 May 2017
Published in: Proceedings of the 4th conference on Innovations in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2422436.2422491
Reasoning under uncertainty in the context of artificial intelligence (68T37) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Robust calibration of numerical models based on relative regret, Unnamed Item, Ranking robustness and its application to evacuation planning, Robust optimization in the presence of uncertainty: a generic approach, Approximately counting approximately-shortest paths in directed acyclic graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Teachability in computational learning
- Measuring teachability using variants of the teaching dimension
- Teaching a smarter learner.
- Occam's razor
- Pseudorandom generators for space-bounded computation
- On the power of inductive inference from good examples
- A model of interactive teaching
- Learning from different teachers
- On the limits of efficient teachability
- In search of an easy witness: Exponential time vs. probabilistic polynomial time.
- On the complexity of teaching
- On specifying Boolean functions by labelled examples
- Recent Developments in Algorithmic Teaching
- A theory of the learnable
- Teaching Randomized Learners
- Algorithmic Learning Theory
- A theory of goal-oriented communication
- Derandomizing polynomial identity tests means proving circuit lower bounds
