✦ LIBER ✦

A new competitive algorithm for group testing

✍ Scribed by Amotz Bar-Noy; Frank K. Hwang; Ilan Kessler; Shay Kutten

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 582 KB
Volume: 52
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)00185-o

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new competitive algorithm for the coun

A new competitive algorithm for the counterfeit coin problem

✍ X.D. Hu; P.D. Chen; F.K. Hwang 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 368 KB

An improved algorithm for quantitative g

An improved algorithm for quantitative group testing

✍ L. Gargano; V. Montouri; G. Setaro; U. Vaccaro 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 574 KB

Testing a new Monte Carlo algorithm for

Testing a new Monte Carlo algorithm for protein folding

✍ Ugo Bastolla; Helge Frauenkron; Erwin Gerstner; Peter Grassberger; Walter Nadler 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 397 KB 👁 1 views

We demonstrate that the recently proposed pruned-enriched Rosenbluth method (PERM) (Grassberger, Phys. Rev. E 56:3682, 1997) leads to extremely efficient algorithms for the folding of simple model proteins. We test it on several models for lattice heteropolymers, and compare it to published Monte Ca

A simplified algorithm for testing micro

A simplified algorithm for testing microprocessors

✍ K.K. Saluja; L. Shen; S.Y.H. Su 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 631 KB

A competitive genetic algorithm for reso

A competitive genetic algorithm for resource-constrained project scheduling

✍ Sönke Hartmann 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 100 KB 👁 2 views

A new archetype for competitive intellig

A new archetype for competitive intelligence

📂 Article 📅 1997 🏛 John Wiley and Sons ⚖ 279 KB 👁 1 views