7065 search results - page 235 / 1413 » Iterative Scheduling Algorithms |
170
click to vote
DATE
2007
IEEE
16 years 23 days ago
2007
IEEE
We present a decomposition strategy to speed up constraint optimization for a representative multiprocessor scheduling problem. In the manner of Benders decomposition, our techniq...
172
click to vote
ETT
2000
15 years 6 months ago
2000
This paper considers all-optical broadcast networks providing a number of slotted WDM channels for packet communications. Each network user is equipped with one tunable transmitter...
130
Voted
GLOBECOM
2006
IEEE
16 years 15 days ago
2006
IEEE
Abstract— In this paper, we propose a power optimal opportunistic scheduling scheme for a multiuser single hop Time Division Multiple Access (TDMA) system. We formulate the probl...
134
Voted
VLDB
1989
ACM
15 years 10 months ago
1989
ACM
Managingtransactionswith real-timerequirements and disk residentdata presentsmany new problems.In thispaperweaddressseveral:How canwe scheduletransactionswith deadlines?How do the...
196
click to vote
ESA
2000
Springer
15 years 10 months ago
2000
Springer
We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the job...