✦ LIBER ✦

Efficiency of Randomized Parallel Backtrack Search

✍ Scribed by Yanjun Zhang; A. Ortynski

Publisher: Springer
Year: 1999
Tongue: English
Weight: 128 KB
Volume: 24
Category: Article
ISSN: 0178-4617
DOI: 10.1007/pl00009269

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient Data Structures for Backtrack

Efficient Data Structures for Backtrack Search SAT Solvers

✍ Inês Lynce; João Marques-Silva 📂 Article 📅 2005 🏛 Springer Netherlands 🌐 English ⚖ 267 KB

Efficient data structures for backtrack

Efficient data structures for backtrack search SAT solvers

✍ Inês Lynce; João Marques-Silva 📂 Article 📅 2004 🏛 Springer Netherlands 🌐 English ⚖ 270 KB

Parallel Randomized Best-First Minimax S

Parallel Randomized Best-First Minimax Search

✍ Yaron Shoham; Sivan Toledo 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 574 KB

Efficiency of the random search method

✍ Y.R. Rubinstein; G. Samorodnitsky 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 746 KB

The efficiency of random search algorithms for both deterministic and stochastic optimization problems is considered.

More Efficient Parallel Totally Monotone

More Efficient Parallel Totally Monotone Matrix Searching

✍ Phillip G Bradford; Rudolf Fleischer; Michiel Smid 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 207 KB

We give a parallel algorithm for computing all row minima in a totally monotone n = n matrix which is simpler and more work efficient than previous polylog-time Ž . Ž . algorithms. It runs in O lg n lg lg n time doing O n lg n work on a CRCW ' 2 Ž Ž . . Ž . PRAM, in O lg n lg lg n time doing O n lg

Generating functions and the performance

Generating functions and the performance of backtracking adaptive search

✍ W. Baritompa; D. W. Bulger; G. R. Wood 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 298 KB