Sciweavers

1205 search results - page 187 / 241
» On P Systems with Bounded Parallelism
Sort
View
IPPS
1997
IEEE
13 years 11 months ago
Designing Efficient Distributed Algorithms Using Sampling Techniques
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...
Sanguthevar Rajasekaran, David S. L. Wei
SPAA
2010
ACM
14 years 14 days ago
Tree network coding for peer-to-peer networks
Partitioning is the dominant technique to transmit large files in peer-to-peer networks. A peer can redistribute each part immediately after its download. BitTorrent combines thi...
Arne Vater, Christian Schindelhauer, Christian Ort...
SEW
2006
IEEE
14 years 1 months ago
Integrating Probability with Time and Shared-Variable Concurrency
Complex software systems typically involve features like time, concurrency and probability, where probabilistic computations play an increasing role. It is challenging to formaliz...
Huibiao Zhu, Shengchao Qin, Jifeng He, Jonathan P....
ESCIENCE
2005
IEEE
14 years 1 months ago
High-Performance Task Distribution for Volunteer Computing
Volunteer computing projects use a task server to manage work. Clients periodically communicate with the server to report completed tasks and get new tasks. The rate at which the ...
David P. Anderson, Eric Korpela, Rom Walton
GCC
2004
Springer
14 years 1 months ago
Agent-Based Resource Selection for Grid Computing
Agent technology is critical in providing solutions to grid computing, including resource selection. Traditionally, agent deliberation offers a deductive process whose deliberation...
Song Shen, Gregory M. P. O'Hare