2714 search results - page 66 / 543 » Approximation Schemes for Scheduling |
117
click to vote
ISORC
2002
IEEE
15 years 5 months ago
2002
IEEE
Functionality for various services of scheduling algorithms is typically provided as extensions to a basic algorithm. Aperiodic task handling, guarantees, etc., are integrated wit...
101
Voted
JAIR
2010
14 years 11 months ago
2010
We present an incentive-compatible polynomial-time approximation scheme for multiunit auctions with general k-minded player valuations. The mechanism fully optimizes over an appro...
124
Voted
COMPGEOM
2004
ACM
15 years 6 months ago
2004
ACM
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...
83
Voted
DAM
2007
15 years 14 days ago
2007
We give a short proof of a result of Tovey [6] on the inapproximability of a scheduling problem known as precedence constrained class sequencing. In addition, we present an approxi...
EMSOFT
2001
Springer
15 years 5 months ago
2001
Springer
: Run-time executives and operating system kernels for embedded systems have long relied exclusively on static priority scheduling of tasks to ensure timing constraints and other c...