554 search results - page 84 / 111 » Approximability of OFDMA Scheduling |
100
click to vote
RANDOM
1998
Springer
15 years 1 months ago
1998
Springer
We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try to pack the items in the minimum ...
ECRTS
2008
IEEE
14 years 11 months ago
2008
IEEE
Modern real-time systems must be designed to be highly adaptable, reacting to aperiodic events in a predictable manner and exhibiting graceful degradation in overload scenarios wh...
AIPS
2004
14 years 11 months ago
2004
We present new results on the problem of finding an enclosing rectangle of minimum area that will contain a given a set of rectangles. Many simple scheduling tasks can be modelled...
AIPS
2003
14 years 11 months ago
2003
Given a set of rectangles with fixed orientations, we want to find an enclosing rectangle of minimum area that contains them all with no overlap. Many simple scheduling tasks ca...
ISCAPDCS
2004
14 years 11 months ago
2004
FG is a programming environment for asynchronous programs that run on clusters and fit into a pipeline framework. It enables the programmer to write a series of synchronous functi...