Sciweavers

1432 search results - page 277 / 287
» Hardness of robust network design
Sort
View
IMC
2007
ACM
13 years 11 months ago
On optimal probing for delay and loss measurement
Packet delay and loss are two fundamental measures of performance. Using active probing to measure delay and loss typically involves sending Poisson probes, on the basis of the PA...
François Baccelli, Sridhar Machiraju, Darry...
SIGMOD
2010
ACM
232views Database» more  SIGMOD 2010»
13 years 9 months ago
Optimizing content freshness of relations extracted from the web using keyword search
An increasing number of applications operate on data obtained from the Web. These applications typically maintain local copies of the web data to avoid network latency in data acc...
Mohan Yang, Haixun Wang, Lipyeow Lim, Min Wang
JSAC
2008
140views more  JSAC 2008»
13 years 9 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham
SIGMETRICS
2008
ACM
117views Hardware» more  SIGMETRICS 2008»
13 years 9 months ago
Epidemic live streaming: optimal performance trade-offs
Several peer-to-peer systems for live streaming have been recently deployed (e.g. CoolStreaming, PPLive, SopCast). These all rely on distributed, epidemic-style dissemination mech...
Thomas Bonald, Laurent Massoulié, Fabien Ma...
JCP
2007
120views more  JCP 2007»
13 years 9 months ago
Mobile Processes: Enhancing Cooperation in Distributed Mobile Environments
— Currently, context awareness is one of the main trends in distributed mobile computing environments. Against this background, the demand for more complex – and additionally l...
Christian P. Kunze, Sonja Zaplata, Winfried Lamers...