✦ LIBER ✦

Probabilistic analysis of a grouping algorithm

✍ Scribed by D. F. Wong; Edward M. Reingold

Publisher: Springer
Year: 1991
Tongue: English
Weight: 617 KB
Volume: 6
Category: Article
ISSN: 0178-4617
DOI: 10.1007/bf01759041

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Probabilistic analysis of numerical inte

Probabilistic analysis of numerical integration algorithms

✍ Feng Gao 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 593 KB

Probabilistic analysis of k-dimensional

Probabilistic analysis of k-dimensional packing algorithms

✍ Dawei Hong; Joseph Y-T. Leung 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 552 KB

Probabilistic analysis of output cost of

Probabilistic analysis of output cost of a heuristic search algorithm

✍ Pradip K. Srimani 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 514 KB

A probabilistic analysis of the Next-Fit

A probabilistic analysis of the Next-Fit bin packing algorithm

✍ Micha Hofri 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 412 KB

Probabilistic analysis of combinatorial

Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations

✍ L. Slominski 📂 Article 📅 1982 🏛 Springer Vienna 🌐 English ⚖ 803 KB

Complexity analysis of the SAT engine: D

Complexity analysis of the SAT engine: DNA algorithms as probabilistic algorithms

✍ Masami Hagiya; John A. Rose; Ken Komiya; Kensaku Sakamoto 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 123 KB

Taking advantage of the power of DNA molecules to spontaneously form hairpin structures, Sakamoto et al. designed a molecular algorithm to solve instances of the satisÿability problem on Boolean expressions in clausal form (the SAT problem), and by developing new experimental techniques for molecula