2084 search results - page 117 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
124
Voted
STACS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
140
Voted
ECRTS
2007
IEEE
15 years 9 months ago
2007
IEEE
This paper investigates resource allocation policies for achieving real-time content distribution with subsecond delay bounds on the current Internet. Resource allocation in real-...
115
click to vote
ICPP
1995
IEEE
15 years 6 months ago
1995
IEEE
If G is a connected graph with N nodes, its r dimensional product contains Nr nodes. We present an algorithm which sorts Nr keys stored in the rdimensional product of any graph G ...
124
click to vote
LCTRTS
2001
Springer
15 years 7 months ago
2001
Springer
This paper presents an end-to-end synthesis technique for lowpower distributed real-time system design. This technique synthesizes supply voltages of resources to optimize system-...
223
Voted
APDC
1997
15 years 4 months ago
1997
Delaunaytriangulationhas beenmuchusedin suchapplicationsas volumerendering, shape representation, terrain modeling and so on. The main disadvantage of Delaunay triangulationis lar...