78 search results - page 11 / 16 » Randomized Parallel Proof-Number Search |
211
Voted
PODC
2011
ACM
14 years 7 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
141
click to vote
IPPS
2007
IEEE
15 years 11 months ago
2007
IEEE
1 The unstructured Peer-to-Peer (P2P) systems usually use a “blind search” method to find the requested data object by propagating a query to a number of peers randomly. In or...
133
click to vote
MIDDLEWARE
2004
Springer
15 years 10 months ago
2004
Springer
Simulation studies are frequently used to evaluate new peer-to-peer searching techniques as well as existing techniques on new applications. Unless these studies are accurate in th...
141
click to vote
EUROPAR
2009
Springer
15 years 11 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....
148
click to vote
OR
2005
Springer
15 years 10 months ago
2005
Springer
In the open route version of the well-known vehicle routing problem, vehicles are not required to return to the depot; or if they are required, then they return by traveling the sa...