| Document Date: 2009-08-13 03:47:05
Open Document File Size: 1,21 MBShare Result on Facebook
City Nashville / / Company Intel Corporation / Computer-Communication Networks / / Country United States / / Currency pence / USD / / IndustryTerm wireless sensor motes / poor solutions / approximation algorithm / near-optimal solutions / pSPIEL algorithm / constant factor approximation algorithms / final solution / wireless sensor network / wireless sensor networks / good approximate solutions / exhaustive search / cheaper solution / approximation algorithms / wireless sensors / sensor networks / data-driven algorithm / polynomial time algorithm / greedy algorithm / approximate solution / i-th chain / good approximation algorithms / closed form solution / approximate algorithm / unconstrained greedy algorithm / search space / wireless communication / sensor network / / OperatingSystem TinyOS / / Organization National Science Foundation / U.S. Securities and Exchange Commission / Cornell University / Carnegie Mellon University / / Person Anupam Gupta / Jon Kleinberg / Gi / Adrian Perrig / Ci / Sini / Anupam Gupta Jon Kleinberg Carnegie / / Position Prime Minister / General / / Product CCR / / ProvinceOrState Tennessee / / Technology Greedy-Connect algorithm / radiation / polynomial time algorithm / following greedy algorithm / GPS / Quota-MST algorithm / pSPIEL algorithm / unconstrained greedy algorithm / good approximation algorithms / polynomial-time / data-driven algorithm / constant factor approximation algorithms / Improved approximation algorithms / proposed algorithm / artificial intelligence / approximation algorithm / greedy algorithm / approximate k-MST algorithm / approximation algorithms / Budget-MST algorithms / g∈C−Cj−1 end end Algorithm / / URL http /
SocialTag |
Near-optimal Sensor Placements: Maximizing Information while Minimizing Communication Cost Andreas Krause Carlos Guestrin