17 search results - page 1 / 4 » Bounds on the Total Redundance and Efficiency of a Graph |
ARSCOM
1999
13 years 5 months ago
1999
WIOPT
2010
IEEE
13 years 3 months ago
2010
IEEE
Abstract--We consider the problem of delay-efficient scheduling in general multihop networks. While the class of max-weight type algorithms are known to be throughput optimal for t...
CGO
2003
IEEE
13 years 9 months ago
2003
IEEE
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...
PODS
1993
ACM
13 years 9 months ago
1993
ACM
In this paper we consider the problem of using disk blocks efficiently in searching graphs that are too large to fit in internal memory. Our model allows a vertex to be represented...
ESA
1994
Springer
13 years 9 months ago
1994
Springer
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a graph having the points of S as its vertices such that for any pair p, q of points ther...