1292 search results - page 165 / 259 » Revisiting the optimal scheduling problem |
136
click to vote
AIPS
2006
15 years 7 months ago
2006
We present a new approach to optimal rectangle packing, an NP-complete problem that can be used to model many simple scheduling tasks. Recent attempts at incorporating artificial ...
187
Voted
CPAIOR
2008
Springer
15 years 7 months ago
2008
Springer
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...
149
Voted
ICC
2007
IEEE
16 years 12 days ago
2007
IEEE
We consider a single-cell multiple-input multiple-output (MIMO) downlink channel where linear transmission and reception strategy is employed. The base station (BS) transmitter is...
170
click to vote
DATE
2009
IEEE
16 years 26 days ago
2009
IEEE
—Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiproce...
158
click to vote
CLUSTER
2005
IEEE
15 years 11 months ago
2005
IEEE
This paper addresses the problem of scheduling parallel tasks, represented by a direct acyclic graph (DAG) on heterogeneous clusters. Parallel tasks, also called malleable tasks, ...