2714 search results - page 299 / 543 » Approximation Schemes for Scheduling |
143
click to vote
LATIN
2010
Springer
15 years 2 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
146
click to vote
MOBICOM
2009
ACM
15 years 10 months ago
2009
ACM
In the literature, asymptotic studies of multi-hop wireless network capacity often consider only centralized and deterministic TDMA (time-division multi-access) coordination schem...
142
Voted
RTAS
2007
IEEE
15 years 10 months ago
2007
IEEE
The prominent energy management technique in real-time embedded systems, Dynamic Voltage and Frequency Scaling (DVFS), was recently shown to have direct and adverse effects on sys...
166
Voted
MOBICOM
2004
ACM
15 years 9 months ago
2004
ACM
Recent years have seen the growing popularity of multi-rate wireless network devices (e.g., 802.11a cards) that can exploit variations in channel conditions and improve overall ne...
135
click to vote
SIGMOD
2000
ACM
15 years 8 months ago
2000
ACM
This paper proposes a scheme for scheduling disk requests that takes advantage of the ability of high-level functions to operate directly at individual disk drives. We show that s...