6105 search results - page 135 / 1221 » A Parallel Algorithm for Bound-Smoothing |
137
click to vote
AE
2003
Springer
15 years 8 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...
139
Voted
ICPP
1995
IEEE
15 years 8 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 ...
135
click to vote
CPHYSICS
2008
15 years 5 months 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...
210
click to vote
ASPDAC
2005
ACM
15 years 7 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...
139
click to vote
IPPS
2006
IEEE
15 years 11 months ago
2006
IEEE
The Replica Exchange method is a popular approach for studying the folding thermodynamics of small to modest size proteins in explicit solvent, since it is easily parallelized. Ho...