Randomized Sensing in Adversarial Environments
暂无分享,去创建一个
[1] Andreas Krause,et al. Near-optimal Observation Selection using Submodular Functions , 2007, AAAI.
[2] M. Stealey,et al. High Resolution River Hydraulic and Water Quality Characterization Using Rapidly Deployable Networked Infomechanical Systems (NIMS RD) , 2007 .
[3] Manish Jain,et al. Computing optimal randomized resource allocations for massive security games , 2009, AAMAS 2009.
[4] Vincent Conitzer,et al. Multi-Step Multi-Sensor Hider-Seeker Games , 2009, IJCAI.
[5] H. B. McMahan,et al. Robust Submodular Observation Selection , 2008 .
[6] Matthew J. Streeter,et al. An Online Algorithm for Maximizing Submodular Functions , 2008, NIPS.
[7] Adam Tauman Kalai,et al. Playing Games with Approximation Algorithms , 2009, SIAM J. Comput..
[8] Andreas Krause,et al. Efficient Informative Sensing using Multiple Robots , 2014, J. Artif. Intell. Res..
[9] Abhimanyu Das,et al. Algorithms for subset selection in linear regression , 2008, STOC.
[10] Jan Vondrák,et al. Optimal approximation for the submodular welfare problem in the value oracle model , 2008, STOC.
[11] Satoru Fujishige,et al. Submodular functions and optimization , 1991 .
[12] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[13] Santosh S. Vempala,et al. Efficient algorithms for online decision problems , 2005, J. Comput. Syst. Sci..
[14] Y. Freund,et al. Adaptive game playing using multiplicative weights , 1999 .