✦ LIBER ✦

The Divide-and-Conquer Approach to the Generalized p -Peg Tower of Hanoi Problem

✍ Scribed by Majumdar, A.A.K.

Book ID: 118124303
Publisher: Taylor and Francis Group
Year: 1995
Tongue: English
Weight: 199 KB
Volume: 34
Category: Article
ISSN: 0233-1934
DOI: 10.1080/02331939508844121

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The generalized p peg tower of hanoi pro

The generalized p peg tower of hanoi problem

✍ Majumdar, A. A. K. 📂 Article 📅 1995 🏛 Taylor and Francis Group 🌐 English ⚖ 271 KB

The generalized four-peg tower of hanoi

The generalized four-peg tower of hanoi problem

✍ Majumdar, A. A. K. 📂 Article 📅 1994 🏛 Taylor and Francis Group 🌐 English ⚖ 609 KB

A recursive algorithm for the multi-peg

A recursive algorithm for the multi-peg tower of hanoi problem

✍ Kaykobad, M.; Rahman, S.T.; Bakhtiar, R-.A.; Majumdar, A.A.K. 📂 Article 📅 1995 🏛 Taylor and Francis Group 🌐 English ⚖ 301 KB

An iterative solution to the generalized

An iterative solution to the generalized Towers of Hanoi problem

✍ M. C. Er 📂 Article 📅 1983 🏛 Springer Netherlands 🌐 English ⚖ 455 KB

Improving the divide-and-conquer approac

Improving the divide-and-conquer approach to sum-of-pairs multiple sequence alignment

✍ J. Stoye; S.W. Perrey; A.W.M. Dress 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 419 KB

We consider the problem of multiple sequence alignment: given k sequences of length at most n and a certain scoring function, find an alignment that minimizes the corresponding "sum of pairs" distance score. We generalize the divide-and-conquer technique described in [1,2], and present new ideas on

Linear-scaling quantum mechanical calcul

Linear-scaling quantum mechanical calculations of biological molecules: The divide-and-conquer approach

✍ Tai-Sung Lee; James P. Lewis; Weitao Yang 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 273 KB