2355 search results - page 240 / 471 » Scheduling in the Z-Polyhedral Model |
145
click to vote
WAOA
2004
Springer
16 years 1 days ago
2004
Springer
Borodin, Nielsen and Rackoff [5] proposed a framework for ing the main properties of greedy-like algorithms with emphasis on scheduling problems, and Davis and Impagliazzo [6] ext...
170
click to vote
LCN
2003
IEEE
15 years 12 months ago
2003
IEEE
Input buffered switches with Virtual Output Queueing (VOQ) can be unstable when presented with unbalanced loads. Existing scheduling algorithms, including iSLIP for Input Queued (...
185
click to vote
EUROPAR
2003
Springer
15 years 12 months ago
2003
Springer
A peer-to-peer model is very useful in solving the server link bottleneck problem of a client-server model. In this work, we discuss the problems of distributing multimedia content...
205
Voted
WSC
2007
15 years 9 months ago
2007
Surgical services require the coordination of many activities, including patient check-in and surgical preparation, surgery, and recovery after surgery. Each of these activities r...
179
click to vote
WSC
2008
15 years 9 months ago
2008
Approximate dynamic programming is emerging as a powerful tool for certain classes of multistage stochastic, dynamic problems that arise in operations research. It has been applie...