149 search results - page 18 / 30 » Optimal Scheduling of Contract Algorithms with Soft Deadline... |
JCO
2000
14 years 9 months ago
2000
We consider the problem of off-line throughput maximization for job scheduling on one or more machines, where each job has a release time, a deadline and a profit. Most of the ver...
RTCSA
2000
IEEE
15 years 2 months ago
2000
IEEE
This paper introduces an exact schedulability analysis for the optional computation model urider a specified failure hypothesis. From this analysis, we propose a solutionfor deter...
114
click to vote
SPAA
1999
ACM
15 years 2 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
DATE
2002
IEEE
15 years 2 months ago
2002
IEEE
Optimizing power consumption at high-level is a critical step towards power-efficient digital system designs. This paper addresses the power management problem by scheduling a giv...
178
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
In highly interactive dynamic web database systems, user satisfaction determines their success. In such systems, userrequested web pages are dynamically created by executing a numb...