✦ LIBER ✦

Algorithms for finding a Kth best valued assignment

✍ Scribed by Tomomi Matsui; Akihisa Tamura; Yoshiko Ikebe

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 826 KB
Volume: 50
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)00175-l

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithms for finding K-best perfect ma

Algorithms for finding K-best perfect matchings

✍ Chandra R. Chegireddy; Horst W. Hamacher 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 661 KB

A parallel algorithm for finding the max

A parallel algorithm for finding the maximum value

✍ Susumu Horiguchi; Willard L Miranker 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 424 KB

A Quantum Algorithm for Finding the Moda

A Quantum Algorithm for Finding the Modal Value

✍ Mark W. Coffey; Zachary Prezkuta 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 60 KB

A space efficient algorithm for finding

A space efficient algorithm for finding the best nonoverlapping alignment score

✍ Gary Benson 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 819 KB

A practical algorithm to find the best s

A practical algorithm to find the best subsequence patterns

✍ Masahiro Hirao; Hiromasa Hoshino; Ayumi Shinohara; Masayuki Takeda; Setsuo Arika 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 171 KB

Given two sets of strings, consider the problem to ÿnd a subsequence that is common to one set but never appears in the other set. We regard it to ÿnd a subsequence pattern which separates these two sets. The problem is known to be NP-complete. We naturally generalize it to an optimization problem,

Bernstein's asymptotic best bound for th

Bernstein's asymptotic best bound for the Kth derivative of a polynomial

✍ Robert Whitley 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 462 KB