✦ LIBER ✦

Improved Speedup Bounds for Parallel Alpha-Beta Search

✍ Scribed by Finkel, Raphael A.; Fishburn, John P.

Book ID: 117930665
Publisher: IEEE
Year: 1983
Tongue: English
Weight: 821 KB
Volume: PAMI-5
Category: Article
ISSN: 0162-8828
DOI: 10.1109/tpami.1983.4767350

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallelism in alpha-beta search

✍ Raphael A. Finkel; John P. Fishburn 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 782 KB

We present a distributed algorithm for implementing a-~ search on a tree of processors. Each processor is an independent computer with its own memory and is connected by communication lines to each of its nearest neighbors. Measurements of the algorithm's performance on the Arachne distributed opera

Upper Bounds for Speedup in Parallel Par

Upper Bounds for Speedup in Parallel Parsing

✍ Cohen, Jacques; Hickey, Timothy; Katcoff, Joel 📂 Article 📅 1982 🏛 Association for Computing Machinery 🌐 English ⚖ 891 KB

A parallel alpha/beta tree searching alg

A parallel alpha/beta tree searching algorithm

✍ Robert M Hyatt; Bruce W Suter; Harry L Nelson 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 688 KB

Unsynchronized iteratively deepening par

Unsynchronized iteratively deepening parallel alpha-beta search

✍ Newborn, M. 📂 Article 📅 1988 🏛 IEEE 🌐 English ⚖ 991 KB

Parallel Algorithms with Optimal Speedup

Parallel Algorithms with Optimal Speedup for Bounded Treewidth

✍ Bodlaender, Hans L.; Hagerup, Torben 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 371 KB

An upper bound for the speedup of parall

An upper bound for the speedup of parallel best-bound branch-and-bound algorithms

✍ Michael J. Quinn; Narsingh Deo 📂 Article 📅 1986 🏛 Springer Netherlands 🌐 English ⚖ 586 KB