641 search results - page 30 / 129 » On robust online scheduling algorithms |
144
click to vote
ICALP
2001
Springer
15 years 10 months ago
2001
Springer
In contrast to classical offline k-k routing, the online packet routing problem allows for an arbitrary number of packets with arbitrary end points and release times. We study this...
179
click to vote
INFOCOM
2009
IEEE
16 years 19 days ago
2009
IEEE
—Most prior studies on wireless spatial-reuse TDMA (STDMA) link scheduling for throughput optimization deal with the situation where instantaneous channel state information (CSI)...
389
click to vote
INFOCOM
2012
IEEE
13 years 8 months ago
2012
IEEE
—Data collection is one of the major traffic pattern in wireless sensor networks, which requires regular source nodes to send data packets to a common sink node with limited end...
149
click to vote
ICNP
2003
IEEE
15 years 11 months ago
2003
IEEE
Practical crossbar scheduling algorithms for CIOQ switches such as PIM and ¢ -SLIP, can perform poorly under extreme traffic conditions, frequently failing to be workconserving....
192
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Computational grids offer users a simple access to tremendous computer resources for solving large scale computing problems. Traditional performance analysis of scheduling algorit...