10106 search results - page 377 / 2022 » Algorithm Selection and Scheduling |
158
click to vote
ISCAS
2005
IEEE
16 years 11 days ago
2005
IEEE
In high-level synthesis, accurate lower-bound estimation is helpful to explore the search space efficiently and to evaluate the quality of heuristic algorithms. For the lower-bound...
145
click to vote
RTSS
1994
IEEE
15 years 11 months ago
1994
IEEE
In this paper we present four new on-line algorithms for servicing soft aperiodic requests in real-time systems, where a set of hard periodic lash is scheduled using the Earliest ...
174
click to vote
SODA
1997
ACM
15 years 8 months ago
1997
ACM
Job-shop scheduling is a classical NP-hard problem. Shmoys, Stein, and Wein presented the first polynomial-time approximation algorithm for this problem that has a good (polylogar...
163
click to vote
ESCIENCE
2006
IEEE
16 years 25 days ago
2006
IEEE
Several scientific projects use BOINC (Berkeley Open Infrastructure for Network Computing) to perform largescale simulations using volunteers’ computers (workers) across the Int...
186
click to vote
PE
2006
Springer
15 years 6 months ago
2006
Springer
Quality of Service (QoS) in terms of end-to-end delay guarantees to real-time applications is an important issue in emerging broadband packet networks. Earliest Deadline First (ED...