359 search results - page 5 / 72 » Order Scheduling Models: Hardness and Algorithms |
88
Voted
TCS
2008
14 years 11 months ago
2008
We study a problem of scheduling client requests to servers. Each client has a particular latency requirement at each server and may choose either to be assigned to some server in ...
GLOBECOM
2008
IEEE
15 years 6 months ago
2008
IEEE
— In this paper, we propose two types of new decoding algorithms for a network coding aided relaying (NCR) system, which adopts multiple antennas at both the transmitter and rece...
RTCSA
2007
IEEE
15 years 6 months ago
2007
IEEE
A task that suspends itself to wait for an I/O completion or to wait for an event from another node in distributed environments is called an I/O blocking task. In conventional har...
JAIR
2007
14 years 11 months ago
2007
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
RTS
2010
14 years 10 months ago
2010
This article presents a detailed discussion of LRE-TL (Local Remaining Execution - TL-plane), an algorithm that schedules hard real-time periodic and sporadic task sets with uncon...