Listar por autoría "dcfae4a5-e168-4267-b98b-1d82f688d932"
Mostrando ítems 1-3 de 3
-
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 ... -
Improving resource location with locally precomputed partial random walks
Springer Vienna (2015-09)Random walks can be used to search complex networks for a desired resource. To reduce search lengths, we propose a mechanism based on building random walks connecting together partial walks (PW) previously computed at each ... -
Resource location based on precomputed partial random walks in dynamic networks
Elsevier (2016)The problem of finding a resource residing in a network node (the resource location problem) is a challenge in complex networks due to aspects as network size, unknown network topology, and network dynamics. The problem ...
