4781 search results - page 200 / 957 » Online algorithms for network design |
177
click to vote
WASA
2009
Springer
16 years 1 months ago
2009
Springer
Social network popularity continues to rise as they broaden out to more users. Hidden away within these social networks is a valuable set of data that outlines everyone’s relatio...
143
click to vote
EUROPAR
2006
Springer
15 years 10 months ago
2006
Springer
This paper is motivated by a need of practical asynchronous network systems, i.e., a wait-free distributed mutual exclusion algorithm (WDME). The WDME algorithm is very appealing w...
172
click to vote
INFOCOM
2007
IEEE
16 years 28 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...
187
click to vote
TWC
2008
15 years 6 months ago
2008
In this paper, designing an effective user relaying algorithm, in terms of relay node selection and power allocation, is discussed for amplify-and-forward wireless relay networks. ...
187
Voted
SODA
2001
ACM
15 years 8 months ago
2001
ACM
Bin covering takes as input a list of items with sizes in (0 1) and places them into bins of unit demand so as to maximize the number of bins whose demand is satis ed. This is in ...