𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A search algorithm for the minimum cost covering of 0–1 integer sets

✍ Scribed by A. Nouh; N. Ula

Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
472 KB
Volume
36
Category
Article
ISSN
0045-7825

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Tight Analysis of the Greedy Algorithm
A Tight Analysis of the Greedy Algorithm for Set Cover
✍ Petr Slavı́k 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 214 KB

We establish significantly improved bounds on the performance of the greedy algorithm for approximating set co¨er. In particular, we provide the first substantial Ž . improvement of the 20-year-old classical harmonic upper bound, H m , of Johnson, Lovasz, and Chvatal, by showing that the performance

Development of a novel genetic algorithm
Development of a novel genetic algorithm search method (GAP1.0) for exploring peptide conformational space
✍ Jin, A. Y.; Leung, F. Y.; Weaver, D. F. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 260 KB 👁 1 views

A genetic algorithm-driven search method GAP1.0; Genetic . Algorithm Peptide search, version 1.0 has been developed for the computational exploration of peptide conformational space. The suitability of a variety of genetic algorithm operators was evaluated through representative calculations w x Ž .

An efficient and derivative-free algorit
An efficient and derivative-free algorithm for finding the minimum of a 1-D user-defined function
✍ F.X. Yu; V.P. Singh 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 634 KB

An efficient algorithm was developed for finding the minimum or maximum of a one-dimensional (I-D) user-defined function. The algorithm combined the quadratic interpolation, the Golden search, and an additional side search into a unified optimal search. Five I-D, four 2-D, and two 4-D functions were