Visualitza LSI_Articles per paraule clau "Average search length"
Ara mostrant els elements 1-2 d 2
-
A model of self-avoiding random walks for searching complex networks
John Wiley & Sons (2012)Random walks have been proven useful in several applications in networks. Some variants of the basic random walk have been devised pursuing a suitable trade-off between better performance and limited cost. A self-avoiding ... -
Performance of random walks in one-hop replication networks
Elsevier (2010)Random walks are gaining much attention from the networks research community. They are the basis of many proposals aimed to solve a variety of network-related problems such as resource location, network construction, nodes ...