1515 search results - page 74 / 303 » Parallel computing on any desktop |
163
click to vote
HPDC
2007
IEEE
15 years 9 months ago
2007
IEEE
Adapting to the network is the key to achieving high performance for communication-intensive applications, including scientific computing, data intensive computing, and multicast...
124
click to vote
IPPS
2006
IEEE
15 years 9 months ago
2006
IEEE
Graph alliances are recently developed global properties of any symmetric graph. Our purpose in the present paper is to design self-stabilizing fault tolerant distributed algorith...
108
click to vote
SPAA
2003
ACM
15 years 8 months ago
2003
ACM
This paper proves that for every positive integers n and k, we can explicitly construct a graph G with n+O(k) vertices and maximum degree 3, such that even after removing any k ve...
SPAA
2010
ACM
15 years 8 months ago
2010
ACM
This paper presents wait-free randomized algorithms for solving set-agreement in asynchronous shared-memory systems under a strong adversary. First, the definition of a shared-co...
225
click to vote
ICDCN
2011
Springer
14 years 6 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...