833 search results - page 38 / 167 » Simpler and better approximation algorithms for network desi... |
132
click to vote
INFOCOM
2007
IEEE
15 years 10 months ago
2007
IEEE
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
170
click to vote
MSWIM
2003
ACM
15 years 9 months ago
2003
ACM
Mobile Ad-Hoc Networks (MANETS) are networks of mobile nodes that do not have a fixed infrastructure. Recent research in this field addresses ways of solving existing problems i...
145
click to vote
RTAS
2006
IEEE
15 years 10 months ago
2006
IEEE
The rapid need for high bandwidth and low latency communication in distributed real-time systems is driving system architects towards high-speed switches developed for high volume...
142
click to vote
SODA
2008
ACM
15 years 5 months ago
2008
ACM
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...
119
click to vote
SAGT
2009
Springer
15 years 10 months ago
2009
Springer
We study the survivable version of the game theoretic network formation model known as the Connection Game, originally introduced in [5]. In this model, players attempt to connect ...