6437 search results - page 121 / 1288 » Parallel Algorithms for Arrangements |
106
click to vote
ISHPC
2003
Springer
15 years 6 months ago
2003
Springer
Most cluster systems used in high performance computing do not allow process relocation at run-time. Finding an allocation that results in minimal completion time is NP-hard and (n...
AE
2003
Springer
15 years 4 months ago
2003
Springer
ParaDisEO is a framework dedicated to the design of parallel and distributed metaheuristics including local search methods and evolutionary algorithms. This paper focuses on the la...
102
click to vote
ICPP
1995
IEEE
15 years 4 months ago
1995
IEEE
If G is a connected graph with N nodes, its r dimensional product contains Nr nodes. We present an algorithm which sorts Nr keys stored in the rdimensional product of any graph G ...
91
Voted
CPHYSICS
2008
15 years 24 days ago
2008
A scalable parallel algorithm has been designed to study long-time dynamics of many-atom systems based on the nudged elastic band method, which performs mutually constrained molec...
150
Voted
ASPDAC
2005
ACM
15 years 2 months ago
2005
ACM
This paper proposes a novel O(n) Parallel Banker’s Algorithm (PBA) with a best-case run-time of O(1), reduced from an ¢¤£¦¥¨§© run-time complexity of the original Ban...