暂无分享,去创建一个
[1] Dong Xuan,et al. On Deploying Wireless Sensors to Achieve Both Coverage and Connectivity , 2006, 2009 5th International Conference on Wireless Communications, Networking and Mobile Computing.
[2] Roger Wattenhofer,et al. Distributed selection: a missing piece of data aggregation , 2008, CACM.
[3] Andreas Krause,et al. Intelligent light control using sensor networks , 2005, SenSys '05.
[4] Avi Ostfeld,et al. The Battle of the Water Sensor Networks (BWSN): A Design Challenge for Engineers and Algorithms , 2008 .
[5] Jan Vondrák,et al. Submodularity in Combinatorial Optimization , 2007 .
[6] Dean P. Foster,et al. Regret in the On-Line Decision Problem , 1999 .
[7] K. Chaloner,et al. Bayesian Experimental Design: A Review , 1995 .
[8] Miodrag Potkonjak,et al. Power efficient organization of wireless sensor networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).
[9] H. Robbins. Some aspects of the sequential design of experiments , 1952 .
[10] Feng Zhao,et al. Information-Driven Dynamic Sensor Collaboration for Tracking Applications , 2002 .
[11] Fan Chung Graham,et al. Concentration Inequalities and Martingale Inequalities: A Survey , 2006, Internet Math..
[12] Peter Auer,et al. The Nonstochastic Multiarmed Bandit Problem , 2002, SIAM J. Comput..
[13] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[14] Stephan Olariu,et al. A survey on leader election protocols for radio networks , 2002, Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02.
[15] Manfred K. Warmuth,et al. The Weighted Majority Algorithm , 1994, Inf. Comput..
[16] Héctor H. González-Baños,et al. A randomized art-gallery algorithm for sensor placement , 2001, SCG '01.
[17] Andreas Krause,et al. Efficient Sensor Placement Optimization for Securing Large Water Distribution Networks , 2008 .
[18] Andreas Krause,et al. Near-optimal Nonmyopic Value of Information in Graphical Models , 2005, UAI.
[19] Robert Haining,et al. Statistics for spatial data: by Noel Cressie, 1991, John Wiley & Sons, New York, 900 p., ISBN 0-471-84336-9, US $89.95 , 1993 .
[20] Andreas Krause,et al. Near-optimal Observation Selection using Submodular Functions , 2007, AAAI.
[21] Matthew J. Streeter,et al. An Online Algorithm for Maximizing Submodular Functions , 2008, NIPS.
[22] Andreas Krause,et al. Optimal Nonmyopic Value of Information in Graphical Models - Efficient Algorithms and Theoretical Limits , 2005, IJCAI.
[23] Mohammad Taghi Hajiaghayi,et al. Regret minimization and the price of total anarchy , 2008, STOC.
[24] Wei Hong,et al. Model-Driven Data Acquisition in Sensor Networks , 2004, VLDB.
[25] Abhimanyu Das,et al. Algorithms for subset selection in linear regression , 2008, STOC.
[26] John W. Fisher,et al. Performance Guarantees for Information Theoretic Active Inference , 2007, AISTATS.
[27] Ashish Goel,et al. Set k-cover algorithms for energy efficient monitoring in wireless sensor networks , 2003, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.
[28] M. Hansen,et al. Participatory Sensing , 2019, Internet of Things.
[29] Andreas Krause,et al. Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies , 2008, J. Mach. Learn. Res..
[30] Wolfgang Maass,et al. Approximation schemes for covering and packing problems in image processing and VLSI , 1985, JACM.