2924 search results - page 226 / 585 » Lower Bounds in Distributed Computing |
145
click to vote
MM
2004
ACM
15 years 9 months ago
2004
ACM
Carriers increasingly differentiate their wide-area connectivity offerings by means of customized services, such as virtual private networks (VPN) with Quality of Service (QoS) g...
114
click to vote
CHI
2010
ACM
15 years 10 months ago
2010
ACM
Recent research has found that forced interruptions at points of higher mental workload are more disruptive than at points of lower workload. This paper investigates a complementa...
141
click to vote
TGC
2007
Springer
15 years 10 months ago
2007
Springer
In computing systems, trust is an expectation on the dynamic behavior of an agent; static analysis is a collection of techniques for establishing static bounds on the dynamic behav...
159
Voted
STOC
2010
ACM
15 years 8 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
135
click to vote
PLDI
1990
ACM
15 years 7 months ago
1990
ACM
- This paper describes techniques for optimizing range checks performed to detect array bound violations. In addition to the elimination of range check:s, the optimizations discuss...