scientific article; zbMATH DE number 7378706
From MaRDI portal
Publication:5009596
DOI10.4230/LIPIcs.ESA.2018.36MaRDI QIDQ5009596
Devorah Kletenik, Dimitrios Gkenosis, Nathaniel Grammel, Lisa Hellerstein
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1806.10660
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Non-adaptive stochastic score classification and explainable halfspace evaluation, A General Framework for Approximating Min Sum Ordering Problems, Adaptivity gaps for the stochastic Boolean function evaluation problem, The stochastic Boolean function evaluation problem for symmetric Boolean functions, Algorithms for the unit-cost stochastic score classification problem
Cites Work
- Unnamed Item
- Unnamed Item
- Supersparse linear integer models for optimized medical scoring systems
- Evaluation of monotone DNF formulas
- An optimum testing algorithm for some symmetric coherent systems
- Submodular goal value of Boolean functions
- Sequential testing of complex systems: a review
- Artificial intelligence and Mathematics IX. Selected papers from the 5th international symposium, Fort Lauderdale, FL, USA, January 2--5, 1998
- Adaptive submodular ranking
- Finding optimal satisficing strategies for and-or trees
- Scenario Submodular Cover
- Optimal Testing Procedures for Special Structures of Coherent Systems
- Comments on the Proof of Adaptive Stochastic Set Cover Based on Adaptive Submodularity and Its Implications for the Group Identification Problem in “Group-Based Active Query Selection for Rapid Diagnosis in Time-Critical Situations”
- A Stochastic Probing Problem with Applications
- Approximation Algorithms for Stochastic Submodular Set Cover with Applications to Boolean Function Evaluation and Min-Knapsack
- Learning Optimized Risk Scores
