Sciweavers

1691 search results - page 239 / 339
» The Delayed k-Server Problem
Sort
View
MMB
2010
Springer
194views Communications» more  MMB 2010»
14 years 2 months ago
Searching for Tight Performance Bounds in Feed-Forward Networks
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
Andreas Kiefer, Nicos Gollan, Jens B. Schmitt
WICON
2008
13 years 11 months ago
Optimal stochastic routing in low duty-cycled wireless sensor networks
We study a routing problem in wireless sensor networks where sensors are duty-cycled. When sensors alternate between on and off modes, delay encountered in packet delivery due to ...
Dongsook Kim, Mingyan Liu
CN
2006
112views more  CN 2006»
13 years 10 months ago
Optimal server allocations for streaming multimedia applications on the Internet
In this paper, we address the server selection problem for streaming applications on the Internet. The architecture we consider is similar to the content distribution networks con...
Padmavathi Mundur, Poorva Arankalle
SCHEDULING
2008
89views more  SCHEDULING 2008»
13 years 9 months ago
On-line decision support for take-off runway scheduling with uncertain taxi times at London Heathrow airport
: This paper addresses the challenge of building an automated decision support methodology to tackle the complex problem faced every day by runway controllers at London Heathrow Ai...
Jason A. D. Atkin, Edmund K. Burke, John S. Greenw...
ICIP
2006
IEEE
14 years 11 months ago
Practical Wyner-Ziv Switching Scheme for Multiple Bit-Rate Video Streaming
In this paper, we propose a novel bit-stream switching scheme for the multiple bit-rate (MBR) video streaming, in which a Wyner-Ziv coded frame is used to overcome the mismatch be...
Mei Guo, Yan Lu, Feng Wu, Debin Zhao, Wen Gao