Sciweavers

379 search results - page 72 / 76
» The Graham-Knowlton Problem Revisited
Sort
View
DCOSS
2006
Springer
13 years 11 months ago
An Optimal Data Propagation Algorithm for Maximizing the Lifespan of Sensor Networks
We consider the problem of data propagation in wireless sensor networks and revisit the family of mixed strategy routing schemes. We show that maximizing the lifespan, balancing th...
Aubin Jarry, Pierre Leone, Olivier Powell, Jos&eac...
FMICS
2006
Springer
13 years 11 months ago
"To Store or Not To Store" Reloaded: Reclaiming Memory on Demand
Behrmann et al. posed the question whether "To Store or Not To Store" [1] states during reachability analysis, in order to counter the effects of the well-known state spa...
Moritz Hammer, Michael Weber
IAT
2009
IEEE
13 years 10 months ago
Bee Hive at Work: Story Tracking Case Study
—Information can change rapidly on the web. For example, news may hint some new story starts to develop. Many more news related to the original event begin to pour in the web. Im...
Pavol Návrat, Lucia Jastrzembska, Tomas Jel...
SODA
2001
ACM
102views Algorithms» more  SODA 2001»
13 years 9 months ago
Approximate majorization and fair online load balancing
This paper relates the notion of fairness in online routing and load balancing to vector majorization as developed by Hardy, Littlewood, and Polya 9]. We de ne -supermajorization ...
Ashish Goel, Adam Meyerson, Serge A. Plotkin
FIW
2000
114views Communications» more  FIW 2000»
13 years 9 months ago
Feature Interaction in Internet Telephony
While Internet telephony aims to provide services at least equal to traditional telephony, the architecture of Internet telephony is sufficiently different to make it necessary to ...
Jonathan Lennox, Henning Schulzrinne