13214 search results - page 113 / 2643 » Pseudorandomness for network algorithms |
159
click to vote
IPSN
2005
Springer
15 years 12 months ago
2005
Springer
A wireless sensor network consists of a large number of small, resource-constrained devices and usually operates in hostile environments that are prone to link and node failures. ...
141
click to vote
JSAC
2006
15 years 6 months ago
2006
A new control algorithm for the multiplane baseline switching network is proposed in this paper. This algorithm chooses a plane for a new connection in such a way that this new con...
168
click to vote
INFOCOM
2007
IEEE
16 years 22 days 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...
152
click to vote
AINTEC
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. When a set of servers are available for a certain client-server style service, a client selects one of the servers using some server selection algorithm. The best-server ...
177
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...