Sciweavers

8540 search results - page 306 / 1708
» The Dynamic Servers Problem
Sort
View
DMSN
2004
ACM
15 years 9 months ago
Mission-critical management of mobile sensors: or, how to guide a flock of sensors
This work addresses the problem of optimizing the deployment of sensors in order to ensure the quality of the readings of the value of interest in a given (critical) geographic re...
Goce Trajcevski, Peter Scheuermann, Hervé B...
128
Voted
APPINF
2003
15 years 5 months ago
Enhance Features and Performance of a Linux-based Content Switch
In this paper we discuss the problems encountered in the development of a Linux LVS-based content switch and present their solutions. A pre-allocate server scheme is proposed to i...
C. Edward Chow, Chandra Prakash
117
Voted
CORR
2006
Springer
132views Education» more  CORR 2006»
15 years 4 months ago
Perturbation Analysis of a Variable M/M/1 Queue: A Probabilistic Approach
Motivated by the problem of the coexistence on transmission links of telecommunication networks of elastic and unresponsive traffic, we study in this paper the impact on the busy p...
Nelson Antunes, Christine Fricker, Fabrice Guillem...
114
Voted
STOC
2007
ACM
109views Algorithms» more  STOC 2007»
16 years 4 months ago
Stability of the max-weight routing and scheduling protocol in dynamic networks and at critical loads
We study the stability of the Max-Weight protocol for combined routing and scheduling in communication networks. Previous work has shown that this protocol is stable for adversari...
Matthew Andrews, Kyomin Jung, Alexander L. Stolyar
267
Voted
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
16 years 4 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup