7065 search results - page 392 / 1413 » Iterative Scheduling Algorithms |
208
click to vote
WASA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. This paper is motivated by exploring the impact of the number of channels on the achievable communication latency for a specific communication task. We focus on how to u...
159
click to vote
ISCAS
2005
IEEE
16 years 13 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 ...
176
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...
173
click to vote
INFOCOM
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract— Data aggregation is a fundamental yet timeconsuming task in wireless sensor networks. We focus on the latency part of data aggregation. Previously, the data aggregation...