25167 search results - page 276 / 5034 » Parallel and Distributed Algorithms |
289
click to vote
ICDCN
2011
Springer
14 years 10 months ago
2011
Springer
This paper considers the problem of calculating dominating sets in networks with bounded degree. In these networks, the maximal degree of any node is bounded by Δ, which is usuall...
154
click to vote
SC
2003
ACM
15 years 12 months ago
2003
ACM
SCALLOP is a highly scalable solver and library for elliptic partial differential equations on regular block-structured domains. SCALLOP avoids high communication overheads algor...
148
click to vote
ICA3PP
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. In this paper we report on the recent progress in computing bivariate polynomial resultants on Graphics Processing Units (GPU). Given two polynomials in Z[x, y], our algo...
218
click to vote
ICPADS
2006
IEEE
16 years 21 days ago
2006
IEEE
Efficient task scheduling is essential for obtaining high performance in heterogeneous distributed computing systems (or HeDCSs). Because of its key importance, several scheduling...
198
click to vote
ICPADS
2007
IEEE
16 years 29 days ago
2007
IEEE
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes...