733 search results - page 8 / 147 » Recommending random walks |
ICC
2009
IEEE
15 years 4 months ago
2009
IEEE
—Random walk (RW) has been widely used as a strategy for searching in peer-to-peer networks. The boom of social network applications introduces new impact to the classical algori...
SODA
2003
ACM
14 years 11 months ago
2003
ACM
We consider the problem of uniformly sampling a vertex of a transportation polytope with m sources and n destinations, where m is a constant. We analyse a natural random walk on t...
78
Voted
MOC
1998
14 years 9 months ago
1998
Abstract. A Cauchy problem for a one–dimensional diffusion–reaction equation is solved on a grid by a random walk method, in which the diffusion part is solved by random walk...
SIAMDM
2010
14 years 4 months ago
2010
If m 2 is constant and 0 r log log n for a small positive constant , then whp a random walk with look-ahead r on a scale-free graph G = G(m, n) has cover time CG(r) (2/(mr-1(...
86
Voted
ASPDAC
2009
ACM
15 years 4 months ago
2009
ACM
— Power distribution networks (PDNs) are designed and analyzed iteratively. Random walk is among the most efficient methods for PDN analysis. We develop in this paper an increme...