8370 search results - page 168 / 1674 » Challenges in P2P Computing |
138
Voted
PPNA
2011
14 years 7 months ago
2011
Several protocol efficiency metrics (e.g., scalability, search success rate, routing reachability and stability) depend on the capability of preserving structure even over the ch...
140
click to vote
IPTPS
2004
Springer
15 years 9 months ago
2004
Springer
We investigate an approach for routing in p2p networks called neighbor-of-neighbor greedy. We show that this approach may reduce significantly the number of hops used, when routi...
124
click to vote
COCO
2003
Springer
15 years 9 months ago
2003
Springer
We show that if SAT does not have small circuits, then there must exist a small number of satisfiable formulas such that every small circuit fails to compute satisfiability corr...
149
click to vote
GPC
2007
Springer
15 years 5 months ago
2007
Springer
This paper describes a Global Computing (GC) environment, called XtremWeb-CH (XWCH). XWCH is an improved version of a GC tool called XtremWeb (XW). XWCH tries to enrich XW in orde...
101
click to vote
SIAMNUM
2010
14 years 10 months ago
2010
In this paper we develop boundary value methods for detecting Sacker-Sell spectra in discrete time dynamical systems. The algorithms are advancements of earlier methods for comput...