733 search results - page 53 / 147 » Recommending random walks |
STOC
2001
ACM
15 years 10 months ago
2001
ACM
In this paper we analyze the behavior of quantum random walks. In particular we present several new results for the absorption probabilities in systems with both one and two absor...
SEFM
2007
IEEE
15 years 4 months ago
2007
IEEE
Directed model checking algorithms focus computation resources in the error-prone areas of concurrent systems. The algorithms depend on some empirical analysis to report their per...
INFOCOM
2011
IEEE
14 years 1 months ago
2011
IEEE
A simple random walk (SRW) has been considered as an effective forwarding method for many applications in wireless sensor networks (WSNs) due to its desirable properties. However...
JCT
2010
14 years 8 months ago
2010
A self-avoiding walk (SAW) on the square lattice is prudent if it never takes a step towards a vertex it has already visited. Prudent walks differ from most classes of SAW that ha...
LCN
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract—We study the performance of several search algorithms on unstructured peer-to-peer networks, both using classic search algorithms such as flooding and random walk, as w...