Algorithms for Queryable Uncertainty
暂无分享,去创建一个
[1] Thomas Erlebach,et al. Computing Minimum Spanning Trees with Uncertainty , 2008, STACS.
[2] David G. Kirkpatrick,et al. Input-Thrifty Extrema Testing , 2011, ISAAC.
[3] Rajeev Raman,et al. Efficient Update Strategies for Geometric Computing with Uncertainty , 2003, Theory of Computing Systems.
[4] Thomas Erlebach,et al. Query-Competitive Algorithms for Computing with Uncertainty , 2015, Bull. EATCS.
[5] TOMÁS FEDER,et al. Computing the median with uncertainty , 2000, STOC '00.
[6] Yajun Wang,et al. Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm , 2015, ICALP.
[7] Anita Schöbel,et al. The robust knapsack problem with queries , 2015, Comput. Oper. Res..
[8] Simon Kahan,et al. A model for data in motion , 1991, STOC '91.
[9] Martin Skutella,et al. Randomization Helps Computing a Minimum Spanning Tree under Uncertainty , 2017, SIAM J. Comput..
[10] Thomas Erlebach,et al. Query-competitive algorithms for cheapest set problems under uncertainty , 2014, Theor. Comput. Sci..
[11] Yogish Sabharwal,et al. The Update Complexity of Selection and Related Problems , 2015, Theory of Computing Systems.
[12] Rajeev Motwani,et al. Computing shortest paths with uncertainty , 2007, J. Algorithms.
[13] Jennifer Widom,et al. Offering a Precision-Performance Tradeoff for Aggregation Queries over Replicated Data , 2000, VLDB.
[14] Sudipto Guha,et al. Model-driven optimization using adaptive probes , 2007, SODA '07.