1380 search results - page 98 / 276 » scheduling 2008 |
107
click to vote
JAIR
2007
15 years 21 days ago
2007
Most classical scheduling formulations assume a fixed and known duration for each activity. In this paper, we weaken this assumption, requiring instead that each duration can be ...
TWC
2008
15 years 21 days 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...
89
Voted
CN
2004
15 years 20 days ago
2004
One of the important issues in the design of future generation of high-speed networks is to provide differentiated service to different types of traffic with various time constrai...
106
click to vote
COMCOM
2004
15 years 20 days ago
2004
One of the important issues in the design of future generation high-speed networks is to provide differentiated services to different types of applications with various time const...
98
Voted
TPDS
1998
15 years 13 days ago
1998
—One of the main obstacles in obtaining high performance from message-passing multicomputer systems is the inevitable communication overhead which is incurred when tasks executin...