New Algorithms for Barrier Coverage with Mobile Sensors
暂无分享,去创建一个
[1] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.
[2] Richard Cole,et al. Slowing down sorting networks to obtain faster sorting algorithms , 2015, JACM.
[3] Mike Burmester,et al. Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region , 2008, COCOA.
[4] Ai Chen,et al. Designing localized algorithms for barrier coverage , 2007, MobiCom '07.
[5] Ian F. Akyildiz,et al. Wireless sensor networks: a survey , 2002, Comput. Networks.
[6] Micha Sharir,et al. An Expander-Based Approach to Geometric Optimization , 1997, SIAM J. Comput..
[7] Nimrod Megiddo,et al. Applying parallel computation algorithms in the design of serial algorithms , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[8] Anish Arora,et al. Barrier coverage with wireless sensors , 2005, MobiCom '05.
[9] Xavier Défago,et al. Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity , 2008, Theor. Comput. Sci..
[10] Pramod K. Varshney,et al. Energy-efficient deployment of Intelligent Mobile sensor networks , 2005, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.
[11] H. Kuhn. The Hungarian method for the assignment problem , 1955 .