✦ LIBER ✦

A fast algorithm to evaluate the shortest distance between rods

✍ Scribed by Carlos Vega; Santiago Lago

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 482 KB
Volume: 18
Category: Article
ISSN: 0097-8485
DOI: 10.1016/0097-8485(94)80023-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A fast algorithm to calculate shortest d

A fast algorithm to calculate shortest distances between linear segments and angular averages for soft repulsive potentials depending on shortest dista

✍ P. Sevilla; S. Lago 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 334 KB

A Comparison between the Fast Multipole

A Comparison between the Fast Multipole Algorithm and the Tree-Code to Evaluate Gravitational Forces in 3-D

✍ R. Capuzzo-Dolcetta; P. Miocchi 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 361 KB

We present tests of comparison between our versions of the Fast Multipole Algorithm (FMA) and the tree-code to evaluate gravitational forces in particle systems. We have optimized Greengard's original version of FMA allowing for a more efficient criterion of well-separation between boxes, to improve

A new algorithm to find the shortest pat

A new algorithm to find the shortest paths between all pairs of nodes

✍ G. Gallo; S. Pallottino 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 834 KB

An algorithm for finding the shortest sa

An algorithm for finding the shortest sailing distance from any maritime navigable point to a designated port

✍ E.R Beeker 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 551 KB

Many simulations and deployment analyses use networks to evaluate ship paths at sea. Ships are constrained to travel along links between specified nodes. When ships may need to change their destination while at sea, the network path can deviate significantly from an actual shortest path. Additionall

A multiple time step algorithm compatibl

A multiple time step algorithm compatible with a large number of distance classes and an arbitrary distance dependence of the time step size for the fast evaluation of nonbonded interactions in molecular simulations

✍ Vincent Kräutler; Philippe H. Hünenberger 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 224 KB

## Abstract A new algorithm is introduced to perform the multiple time step integration of the equations of motion for a molecular system, based on the splitting of the nonbonded interactions into a series of distance classes. The interactions between particle pairs in successive classes are update

Fast recursive algorithm to evaluate the

Fast recursive algorithm to evaluate the reliability of a circular consecutive-k-out-of-n:F system: Ira Antonopoulou and Stavros Papastavridis. IEEE Trans. Reliab.R-36, 83 (1987)

📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 126 KB