Sciweavers

338 search results - page 42 / 68
» Fast distributed random walks
Sort
View
QUESTA
2011
14 years 15 days 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
CIKM
2008
Springer
14 years 11 months ago
Dr. Searcher and Mr. Browser: a unified hyperlink-click graph
We introduce a unified graph representation of the Web, which includes both structural and usage information. We model this graph using a simple union of the Web's hyperlink ...
Barbara Poblete, Carlos Castillo, Aristides Gionis
75
Voted
CEC
2010
IEEE
14 years 8 months ago
Gaussian Adaptation as a unifying framework for continuous black-box optimization and adaptive Monte Carlo sampling
Abstract— We present a unifying framework for continuous optimization and sampling. This framework is based on Gaussian Adaptation (GaA), a search heuristic developed in the late...
Christian L. Müller, Ivo F. Sbalzarini
WWW
2002
ACM
15 years 10 months ago
The structure of broad topics on the web
The Web graph is a giant social network whose properties have been measured and modeled extensively in recent years. Most such studies concentrate on the graph structure alone, an...
Soumen Chakrabarti, Mukul Joshi, Kunal Punera, Dav...
DCOSS
2011
Springer
13 years 9 months ago
Planning the trajectories of multiple mobile sinks in large-scale, time-sensitive WSNs
—Controlled sink mobility has been shown to be very beneficial in lifetime prolongation of wireless sensor networks (WSNs) by avoiding the typical hot-spot problem near the sink...
Wint Yi Poe, Michael Beck, Jens B. Schmitt