169 search results - page 14 / 34 » Decentralized Search with Random Costs |
ICDCSW
2006
IEEE
14 years 23 days ago
2006
IEEE
— Existing searching schemes in unstructured P2Ps can be categorized as either blind or informed. The quality of query results in blind schemes is low. Informed schemes use simpl...
INFOCOM
2009
IEEE
14 years 1 months ago
2009
IEEE
—Distributed object search is the primary function of Peer-to-Peer (P2P) file sharing system to locate and transfer the file. The predominant search schemes in unstructured P2P...
SAT
2010
Springer
13 years 5 months ago
2010
Springer
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
EUROPAR
2009
Springer
14 years 1 months ago
2009
Springer
Selecting a random peer with uniform probability across a peer-to-peer (P2P) network is a fundamental function for unstructured search, data replication, and monitoring algorithms....
GLOBECOM
2006
IEEE
14 years 24 days ago
2006
IEEE
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...