2714 search results - page 135 / 543 » Approximation Schemes for Scheduling |
119
click to vote
TWC
2008
15 years 3 months ago
2008
To provide a near-optimal low-complexity solution to parallel multiuser scheduling in code-division multiple-access (CDMA), we propose generalized selection multiuser diversity (GS...
126
Voted
IOR
2010
15 years 1 months ago
2010
In many applications involving make-to-order or time-sensitive (e.g., perishable, seasonal) products, finished orders are often delivered to customers immediately or shortly after...
131
Voted
ICC
2007
IEEE
15 years 9 months ago
2007
IEEE
—Opportunistic scheduling in random beamforming maximizes the sum-rate by allocating resources to the users with the best channel condition, thus leveraging on multiuser diversit...
137
Voted
WIOPT
2006
IEEE
15 years 9 months ago
2006
IEEE
— In this paper, a scheduling problem in wireless networks is considered when there simultaneously exist CBR (constant bit rate) users requiring exact minimum average throughput ...
107
Voted
CLUSTER
2004
IEEE
15 years 7 months ago
2004
IEEE
Considerable research has focused on the problem of scheduling dynamically arriving independent parallel jobs on a given set of resources. There has also been some recent work in ...