István Lorentz

Learn More
—We present a combination of methods addressing the molecular distance problem, implemented on a graphic processing unit. First, we use geometric build-up and depth-first graph traversal. Next, we refine the solution by simulated annealing. For an exact but sparse distance matrix, the build-up method reconstructs the 3D structures with a root-mean-square(More)
We discuss massively parallel implementation issues of the following heuristic optimization methods: Evolution Strategy , Genetic Algorithms, Harmony Search, and Simulated Annealing. For the first time, we implement these algorithms on the Connex architecture, a recently designed array of 1024 processing elements. We use the Vector-C programming environment(More)
  • 1