460 search results - page 71 / 92 » Bounding the locality of distributed routing algorithms |
ISAAC
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel platforms. However, with the increasing number of processors, the cost...
FORMATS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Quantitative model checking computes the probability values of a given property quantifying over all possible schedulers. It turns out that maximum and minimum probabilit...
AAAI
2008
13 years 10 months ago
2008
With the success of local features in object recognition, feature-set representations are widely used in computer vision and related domains. Pyramid match kernel (PMK) is an effi...
SPAA
1995
ACM
13 years 11 months ago
1995
ACM
We study the problem of sorting on a parallel computer with limited communication bandwidth. By using the PRAM(m) model, where p processors communicate through a globally shared me...
ICDCS
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper we propose a novel algorithm called Rank-Based Broadcast (RBB) for discovery of local resources in mobile P2P networks. With RBB, each moving object periodically bro...