1059 search results - page 60 / 212 » Improved Algorithms via Approximations of Probability Distri... |
GLOBECOM
2006
IEEE
15 years 3 months ago
2006
IEEE
In this letter we develop an expression for the approximate throughput guarantee violation probability (TGVP) for users in time-slotted networks for any scheduling algorithm with ...
112
click to vote
CORR
2011
Springer
14 years 1 months ago
2011
Springer
Opportunistic scheduling and routing can in principle greatly increase the throughput of decentralized wireless networks, but to be practical such algorithms must do so with small...
DC
2010
14 years 9 months ago
2010
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
MASCOTS
2001
14 years 11 months ago
2001
Farsite is a scalable, distributed file system that logically functions as a centralized file server but that is physically implemented on a set of client desktop computers. Farsi...
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
—The implementation of distributed network utility maximization (NUM) algorithms hinges heavily on information feedback through message passing among network elements. In practic...