348 search results - page 55 / 70 » Distributed Approximation Algorithm for Resource Clustering |
JSSPP
2005
Springer
15 years 7 months ago
2005
Springer
Our main goal in this paper is to study the scheduling of parallel BSP tasks on clusters of computers. We focus our attention on special characteristics of BSP tasks, which can use...
147
click to vote
FSTTCS
1993
Springer
15 years 6 months ago
1993
Springer
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
116
click to vote
COMPGEOM
2006
ACM
15 years 8 months ago
2006
ACM
We study the problem of minimum-distortion embedding of ultrametrics into the plane and higher dimensional spaces. Ultrametrics are a natural class of metrics that frequently occu...
127
click to vote
PDP
2006
IEEE
15 years 8 months ago
2006
IEEE
Re-ranking the search results using PageRank is a well-known technique used in modern search engines. Running an iterative algorithm like PageRank on a large web graph consumes bo...
148
click to vote
EUROPAR
2009
Springer
14 years 11 months ago
2009
Springer
Unstructured overlay networks for peer-to-peer applications combined with stochastic algorithms for clustering and resource location are attractive due to low-maintenance costs and...