2976 search results - page 200 / 596 » On the bounded integer programming |
160
click to vote
IFIP
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. This paper extends existing models for collaborative systems. We investigate how much damage can be done by insiders alone, without collusion with an outside adversary. I...
156
click to vote
CASSIS
2004
Springer
15 years 12 months ago
2004
Springer
We present the Mobile Resource Guarantees framework: a system for ensuring that downloaded programs are free from run-time violations of resource bounds. Certificates are attached...
133
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
We show that linear probing requires 5-independent hash functions for expected constant-time performance, matching an upper bound of [Pagh et al. STOC’07]. For (1 + ε)-approxima...
171
click to vote
PLDI
1993
ACM
15 years 10 months ago
1993
ACM
This paper shows how to software pipeline a loop for minimal register pressure withoutsacrificing the loop’s minimum execution time. This novel bidirectional slack-scheduling m...
143
click to vote
COCOON
2007
Springer
16 years 19 days ago
2007
Springer
We propose new algorithms and improved bounds for interference-aware routing in wireless networks. First, we prove that n arbitrarily matched source-destinations pairs with average...