Sciweavers

1205 search results - page 187 / 241
» On P Systems with Bounded Parallelism
Sort
View
138
Voted
IPPS
1997
IEEE
15 years 7 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
139
Voted
SPAA
2010
ACM
15 years 8 months 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...
138
Voted
SEW
2006
IEEE
15 years 9 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....
128
Voted
ESCIENCE
2005
IEEE
15 years 9 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
129
Voted
GCC
2004
Springer
15 years 9 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