2095 search results - page 81 / 419 » Improved pebbling bounds |
OPODIS
2010
13 years 8 months ago
2010
The Earliest Deadline First (EDF) scheduling algorithm is known to be suboptimal for meeting all deadlines under global scheduling on multiprocessor platforms. However, EDF is an a...
CORR
2011
Springer
13 years 5 months ago
2011
Springer
Let R be a real closed field, P, Q ⊂ R[X1, . . . , Xk] finite subsets of polynomials, with the degrees of the polynomials in P (resp. Q) bounded by d (resp. d0). Let V ⊂ Rk b...
JCS
2011
13 years 5 months ago
2011
Many distance bounding protocols appropriate for the RFID technology have been proposed recently. Unfortunately, they are commonly designed without any formal approach, which lead...
FOCS
2008
IEEE
14 years 4 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
IPPS
2007
IEEE
14 years 4 months ago
2007
IEEE
Compositional performance analysis iteratively alternates local scheduling analysis techniques and output event model propagation between system components to enable performance a...