10106 search results - page 450 / 2022 » Algorithm Selection and Scheduling |
179
click to vote
INFOCOM
2005
IEEE
16 years 14 days ago
2005
IEEE
— We consider the problem of scheduling a sequence of packets over a linear network, where every packet has a source and a target, as well as a release time and a deadline by whi...
155
click to vote
AI
2003
Springer
16 years 3 days ago
2003
Springer
The multi-processor total tardiness problem (MPTTP) is an ÆÈ-hard scheduling problem, in which the goal is to minimise the tardiness of a set of jobs that are processed on a numb...
180
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
We study routing and scheduling in packet-switched networks. We assume an adversary that controls the injection time, source, and destination for each packet injected. A set of pat...
223
click to vote
TMC
2010
15 years 5 months ago
2010
—Throughput optimization in wireless networks with multiple channels and multiple radio interfaces per node is a challenging problem. For general traffic models (given a set of ...
210
click to vote
CP
2004
Springer
16 years 8 days ago
2004
Springer
This paper considers the problem of transforming a resource feasible, fixed-times schedule into a partial order schedule (POS) to enhance its robustness and stability properties. ...