𝔖 Bobbio Scriptorium
✦   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

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


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
✍ 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