Sciweavers

239 search results - page 45 / 48
» Random walks in a supply network
Sort
View
QUESTA
2011
12 years 10 months ago
Uniform approximations for the M/G/1 queue with subexponential processing times
: This paper studies the asymptotic behavior of the steady-state waiting time, W∞, of the M/G/1 queue with subexponenential processing times for different combinations of traffi...
Mariana Olvera-Cravioto, Peter W. Glynn
PVLDB
2010
220views more  PVLDB 2010»
13 years 2 months ago
Fast Incremental and Personalized PageRank
In this paper, we analyze the efficiency of Monte Carlo methods for incremental computation of PageRank, personalized PageRank, and similar random walk based methods (with focus o...
Bahman Bahmani, Abdur Chowdhury, Ashish Goel
TKDE
2011
528views more  TKDE 2011»
13 years 2 months ago
The CoQUOS Approach to Continuous Queries in Unstructured Overlays
—The current peer-to-peer (P2P) content distribution systems are constricted by their simple on-demand content discovery mechanism. The utility of these systems can be greatly en...
Lakshmish Ramaswamy, Jianxia Chen
ICNP
2009
IEEE
14 years 2 months ago
ESC: Energy Synchronized Communication in Sustainable Sensor Networks
—With advances in energy harvesting techniques, it is now feasible to build sustainable sensor networks (SSN) to support long-term applications. Unlike battery-powered sensor net...
Yu Gu, Ting Zhu, Tian He
WSNA
2003
ACM
14 years 18 days ago
Analysis on the redundancy of wireless sensor networks
Wireless sensor networks consist of a large number of tiny sensors that have only limited energy supply. One of the major challenges in constructing such networks is to maintain l...
Yong Gao, Kui Wu, Fulu Li