7065 search results - page 340 / 1413 » Iterative Scheduling Algorithms |
213
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Opportunistic scheduling and routing can in principle greatly increase the throughput of decentralized wireless networks, but to be practical such algorithms must do so with small...
194
click to vote
RTS
2011
14 years 9 months ago
2011
This paper is an extended version of a paper that appeared in the proceedings of the IEEE Real-Time Systems Symposium 2009. This paper has been updated with respect to advances ma...
183
click to vote
KR
2004
Springer
16 years 3 days ago
2004
Springer
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
206
Voted
ISAAC
2001
Springer
15 years 11 months ago
2001
Springer
In current networks, packet losses can occur if routers do not provide sufficiently large buffers. This paper studies how many buffers should be provided in a router to eliminat...
154
click to vote
RANDOM
1999
Springer
15 years 11 months ago
1999
Springer
We investigate an online version of a basic scheduling problem where a set of jobs has to be scheduled on a number of identical machines so as to minimize the makespan. The job pr...