197 search results - page 28 / 40 » Robust Parallel Computations through Randomization |
GCC
2003
Springer
15 years 2 months ago
2003
Springer
— The peer-to-peer network for sharing information and data through direct exchange has emerged rapidly in recent years. The searching problem is a basic issue that addresses the...
77
Voted
GCC
2006
Springer
15 years 1 months ago
2006
Springer
In this paper, we propose a new scheduling algorithm with economic theory, called Black Scholes Market (BSM) algorithm for a class of Dynamic Jobs (DJ). BSM is based on the classi...
ICDCS
2008
IEEE
15 years 4 months ago
2008
IEEE
In most large-scale peer-to-peer (P2P) applications, it is necessary to collect vital statistics data — sometimes referred to as logs — from up to millions of peers. Tradition...
74
Voted
IPPS
2007
IEEE
15 years 3 months ago
2007
IEEE
Resource scheduling in large-scale, volatile desktop grids is challenging because resource state is both dynamic and eclectic. Matching available resources with requests is not al...
IPPS
2003
IEEE
15 years 2 months ago
2003
IEEE
In open multi-agent systems agents need resources provided by other agents but they are not aware of which agents provide the particular resources. Most solutions to this problem ...