148 search results - page 11 / 30 » Optimizing random walk search algorithms in P2P networks |
ICDM
2005
IEEE
15 years 5 months ago
2005
IEEE
Many real applications can be modeled using bipartite graphs, such as users vs. files in a P2P system, traders vs. stocks in a financial trading system, conferences vs. authors ...
101
Voted
CIKM
2005
Springer
15 years 5 months ago
2005
Springer
Peer-to-peer (p2p) systems offer an efficient means of data sharing among a dynamically changing set of a large number of autonomous nodes. Each node in a p2p system is connected...
LCN
2007
IEEE
15 years 6 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...
87
Voted
P2P
2007
IEEE
15 years 5 months ago
2007
IEEE
Network coding is an emerging field of research with sound and mature theory supporting it. Recent works shows that it has many benefits like improved fault tolerance, higher ...
101
Voted
ASPDAC
2007
ACM
15 years 3 months ago
2007
ACM
- This paper proposes a fast and practical decoupling capacitor (decap) budgeting algorithm to optimize the power ground (P/G) network design. The new method adopts a modified rand...