1205 search results - page 90 / 241 » On P Systems with Bounded Parallelism |
88
Voted
COMBINATORICS
2002
15 years 3 months ago
2002
We give a generalization for the Deza-Frankl-Singhi Theorem in case of multiple intersections. More exactly, we prove, that if H is a set-system, which satisfies that for some k, ...
103
Voted
PPOPP
2010
ACM
16 years 26 days ago
2010
ACM
This paper presents and validates performance models for a variety of high-performance collective communication algorithms for systems with Cell processors. The systems modeled in...
141
Voted
ICPP
2007
IEEE
15 years 10 months ago
2007
IEEE
— Most of existing search algorithms for unstructured peer-to-peer (P2P) systems share one common approach: the requesting node sends out a query and the query message is repeate...
144
click to vote
ICPP
2009
IEEE
15 years 1 months ago
2009
IEEE
Peer-to-peer (P2P) storage systems rely on data redundancy to obtain high levels of data availability. Among the existing data redundancy schemes, erasure coding is a widely adopte...
165
Voted
CCGRID
2003
IEEE
15 years 9 months ago
2003
IEEE
The widespread use of broadband networks and the evolution of Peer-to-Peer systems changed dramatically the way Internet is used today. P2P file sharing networks are one of the mo...