✦ LIBER ✦

Fast search algorithms for the n-queens problem

✍ Scribed by Sosic, R.; Gu, J.

Book ID: 114550319
Publisher: Institute of Electrical and Electronics Engineers
Year: 1991
Weight: 566 KB
Volume: 21
Category: Article
ISSN: 0018-9472
DOI: 10.1109/21.135698

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A group-based search for solutions of th

A group-based search for solutions of the n-queens problem

✍ Matthias R. Engelhardt 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 234 KB

The n-queens problem

✍ A. Bruen; R. Dixon 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 340 KB

Fast Algorithms for the Density Finding

Fast Algorithms for the Density Finding Problem

✍ D. T. Lee; Tien-Ching Lin; Hsueh-I Lu 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 420 KB

Fast algorithms for the maximum convolut

Fast algorithms for the maximum convolution problem

✍ Michael Bussieck; Hannes Hassler; Gerhard J. Woeginger; Uwe T. Zimmermann 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 487 KB

Fast Search Algorithms for VQ Codebook G

Fast Search Algorithms for VQ Codebook Generation

✍ Jim Z.C. Lai; C.C. Lue 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 230 KB

In this paper, we propose two fast codebook generation algo-book. Some alternative methods are also available [14]. rithms by making use of the information in the iterative process. The pairwise Nearest Neighbor (PNN) algorithm is a new Comparing to the conventional full search method (the LBG alter

Fast search algorithm for tolerance desi

Fast search algorithm for tolerance design

✍ Lin, Y.; Foo, S.W. 📂 Article 📅 1998 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 496 KB