2814 search results - page 186 / 563 » Competitive Analysis of Distributed Algorithms |
128
Voted
INFOSCALE
2006
ACM
15 years 6 months ago
2006
ACM
The popularity and bandwidth consumption attributed to current Peer-to-Peer file-sharing applications makes the operation of these distributed systems very important for the Inte...
107
click to vote
STOC
2009
ACM
16 years 1 months ago
2009
ACM
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
112
Voted
PLDI
2009
ACM
15 years 7 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
113
click to vote
ICML
1999
IEEE
16 years 1 months ago
1999
IEEE
Many interesting problems, such as power grids, network switches, and tra c ow, that are candidates for solving with reinforcement learningRL, alsohave properties that make distri...
SOSP
2003
ACM
15 years 9 months ago
2003
ACM
Many interesting large-scale systems are distributed systems of multiple communicating components. Such systems can be very hard to debug, especially when they exhibit poor perfor...