✦ LIBER ✦

A face search heuristic algorithm for optimizing over the efficient set

✍ Scribed by Harold P. Benson; Serpil Sayin

Publisher: John Wiley and Sons
Year: 1993
Tongue: English
Weight: 769 KB
Volume: 40
Category: Article
ISSN: 0894-069X
DOI: 10.1002/1520-6750(199302)40:1<103::aid-nav3220400107>3.0.co;2-a

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Optimal Algorithm for the Intersectio

An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons

✍ Shreesh Jadhav; Asish Mukhopadhyay; Binay Bhattacharya 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 224 KB

The intersection radius of a finite collection of geometrical objects in the plane is the radius of the smallest closed disk that intersects all the objects in the collection. Bhattacharya et al. showed how the intersection radius can be found in linear time for a collection of line segments in the

Strategies for increasing the efficiency

Strategies for increasing the efficiency of a genetic algorithm for the structural optimization of nanoalloy clusters

✍ Lesley D. Lloyd; Roy L. Johnston; Said Salhi 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 184 KB 👁 1 views

## Abstract An improved genetic algorithm (GA) is described that has been developed to increase the efficiency of finding the global minimum energy isomers for nanoalloy clusters. The GA is optimized for the example Pt~12~Pd~12~, with specific investigation of: the effect of biasing the initial pop

Standardization Protocols and Optimized

Standardization Protocols and Optimized Precursor Sets for the Efficient Application of Automated Parallel Synthesis to Lead Optimization: A Mitsunobu Example.

✍ Robert G. Gentles; Dariusz Wodka; David C. Park; Anil Vasudevan 📂 Article 📅 2003 🏛 John Wiley and Sons ⚖ 134 KB

Optimization of Pearl‘s method of condit

Optimization of Pearl‘s method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem : A. Becker and D. Geiger

📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 78 KB

Forthcoming Papers ## A. Becker and D. Geiger, Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem We show how to find a small loop curser in a Bayesian network. Finding such a loop cutset is the first step in the method of c