Sciweavers

6978 search results - page 50 / 1396
» On Proofs in System P
Sort
View
COCO
1991
Springer
173views Algorithms» more  COCO 1991»
14 years 1 months ago
On the Random-Self-Reducibility of Complete Sets
Abstract. In this paper, we generalize the previous formal de nitions of random-self-reducibility. We show that, even under our very general de nition, sets that are complete for a...
Joan Feigenbaum, Lance Fortnow
IPPS
2005
IEEE
14 years 3 months ago
To Unify Structured and Unstructured P2P Systems
Most of current peer-to-peer designs build their own system overlays independent of the physical one. Nodes within unstructured systems form a random overlay, on the contrary, str...
Honghao Wang, Yingwu Zhu, Yiming Hu
EUROPAR
2007
Springer
14 years 3 months ago
Acyclic Preference Systems in P2P Networks
In this work we study preference systems suitable for the Peer-to-Peer paradigm. Most of them fall in one of the three following categories: global, symmetric and complementary. Al...
Anh-Tuan Gai, Dmitry Lebedev, Fabien Mathieu, Fabi...
SIGECOM
2006
ACM
155views ECommerce» more  SIGECOM 2006»
14 years 3 months ago
Incentives engineering for structured P2P systems - a feasibility demonstration using economic experiments
Structured peer-to-peer systems allow to administer large volumes of data. Several peers collaborate to generate a query result. Analyses of unstructured peer-to-peer systems, nam...
Stephan Schosser, Klemens Böhm, Rainer Schmid...