794 search results - page 37 / 159 » Stackelberg scheduling strategies |
102
Voted
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
— Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation, or message-passing, algorithm over the factor graph of the code. The tradi...
94
Voted
INFOCOM
2003
IEEE
15 years 5 months ago
2003
IEEE
— Third generation code-division multiple access (CDMA) systems propose to provide packet data service through a high speed shared channel with intelligent and fast scheduling at...
108
click to vote
IPPS
2000
IEEE
15 years 4 months ago
2000
IEEE
As communication and I/O traffic increase on the interconnection network of high-performance systems, network contention becomes a critical problem drastically reducing performan...
105
click to vote
DATE
2003
IEEE
15 years 5 months ago
2003
IEEE
We present two novel strategies to increase the scope for application of speculative code motions: (1) Adding scheduling steps dynamically during scheduling to conditional branche...
MASCOTS
2003
15 years 1 months ago
2003
This paper uses a probe-based sampling approach to study the behavioural properties of Web server scheduling strategies, such as Processor Sharing (PS) and Shortest Remaining Proc...