733 search results - page 12 / 147 » Recommending random walks |
113
click to vote
MSWIM
2006
ACM
15 years 3 months ago
2006
ACM
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
ICC
2008
IEEE
15 years 4 months ago
2008
IEEE
—The class of isotropic random walk mobility models, including Random Direction mobility model, Random Walk mobility model and Brownian motion mobility model, has been widely use...
QUESTA
2008
14 years 9 months ago
2008
To obtain insight in the quality of heavy-traffic approximations for queues with many servers, we consider the steady-state number of waiting customers in an M/D/s queue as s . I...
81
Voted
STOC
2002
ACM
15 years 10 months ago
2002
ACM
Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler a...
WIA
2009
Springer
15 years 4 months ago
2009
Springer
Uniform random generators deliver a simple empirical means to estimate the average complexity of an algorithm. We present a general rejection algorithm that generates sequential le...