25167 search results - page 167 / 5034 » Parallel and Distributed Algorithms |
163
click to vote
ICPPW
2006
IEEE
16 years 11 days ago
2006
IEEE
Homotopy methods to solve polynomial systems are well suited for parallel computing because the solution paths defined by the homotopy can be tracked independently. For sparse po...
146
click to vote
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
For hypercube networks which have faulty nodes, a few ecient dynamic routing algorithms have been proposed by allowing each node to hold the status of neighbors. We propose two im...
191
Voted
LATIN
2010
Springer
16 years 1 months ago
2010
Springer
Topological self-stabilization is an important concept to build robust open distributed systems (such as peer-to-peer systems) where nodes can organize themselves into meaningful n...
180
click to vote
EUROPAR
2006
Springer
15 years 10 months ago
2006
Springer
Computations on two-dimensional arrays such as matrices and images are one of the most fundamental and ubiquitous things in computational science and its vast application areas, bu...
153
click to vote
IPPS
2007
IEEE
16 years 19 days ago
2007
IEEE
Computational grids clusters, provide powerful computing resources for executing applications of large scale. In Grid (clusters) usually several applications run simultaneously.Th...