2084 search results - page 146 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
160
Voted
CLUSTER
2001
IEEE
15 years 8 months ago
2001
IEEE
Given the increasing traffic on the World Wide Web (Web), it is difficult for a single popular Web server to handle the demand from its many clients. By clustering a group of Web ...
118
click to vote
MOBIHOC
2009
ACM
16 years 5 months ago
2009
ACM
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
124
click to vote
ICDCS
2007
IEEE
15 years 11 months ago
2007
IEEE
Peer to peer (P2P) systems are moving from application specific architectures to a generic service oriented design philosophy. This raises interesting problems in connection with...
104
Voted
ISPD
1998
ACM
15 years 9 months ago
1998
ACM
—The greedy wire-sizing algorithm (GWSA) has been experimentally shown to be very efficient, but no mathematical analysis on its convergence rate has ever been reported. In this...
129
Voted
FOCS
2010
IEEE
15 years 3 months ago
2010
IEEE
We present a new algorithm for learning a convex set in n-dimensional space given labeled examples drawn from any Gaussian distribution. The complexity of the algorithm is bounded ...