𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient Implementation of the Nelder–Mead Search Algorithm

✍ Scribed by Saša Singer; Sanja Singer

Publisher
John Wiley and Sons
Year
2004
Weight
137 KB
Volume
1
Category
Article
ISSN
1611-8170

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficiency of tabu-search-based conforma
Efficiency of tabu-search-based conformational search algorithms
✍ Christoph Grebner; Johannes Becker; Svetlana Stepanenko; Bernd Engels 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 571 KB

## Abstract Efficient conformational search or sampling approaches play an integral role in molecular modeling, leading to a strong demand for even faster and more reliable conformer search algorithms. This article compares the efficiency of a molecular dynamics method, a simulated annealing method

Efficient algorithm for conformational s
Efficient algorithm for conformational search of macrocyclic molecules
✍ Wang, Cheuk-San 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 345 KB 👁 2 views

A new algorithm, complementarity, is developed for conformational search of macrocyclic molecules. The algorithm scans a large number of candidate conformations and energy-minimizes only the promising ones. These candidates can be generated by two operators that construct new conformations from know

An efficient concurrent implementation o
An efficient concurrent implementation of a neural network algorithm
✍ R. Andonie; A. T. Chronopoulos; D. Grosu; H. Galmeanu 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 202 KB

The focus of this study is how we can efficiently implement the neural network backpropagation algorithm on a network of computers (NOC) for concurrent execution. We assume a distributed system with heterogeneous computers and that the neural network is replicated on each computer. We propose an arc

An efficient implementation of an algori
An efficient implementation of an algorithm for findingK shortest simple paths
✍ Hadjiconstantinou, E.; Christofides, N. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 263 KB 👁 1 views

In this article, we present an efficient computational implementation of an algorithm for finding the K shortest simple paths connecting a pair of vertices in an undirected graph with n vertices, m arcs, and nonnegative arc lengths. A minimal number of intermediate paths is formed based on the metho