𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Optimal algorithms for generalized searching in sorted matrices

✍ Scribed by Hong Shen

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
705 KB
Volume
188
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On Parallel Selection and Searching in P
On Parallel Selection and Searching in Partial Orders: Sorted Matrices
✍ R. Sarnath; Xin He πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 246 KB

rithm given by Cole [3] runs in O(log n log\* n) time on an EREW PRAM and in O(log n log\* n/log log n) time on a CRCW PRAM. Both algorithms perform O(n) operations. However, not much work has been done on parallel algorithms for constrained selection. The sequential algorithm in [5] is parallelizab

Identification algorithms for fuzzy rela
Identification algorithms for fuzzy relational matrices, Part 2: Optimizing algorithms
✍ Mary M. Bourke; D. Grant Fisher πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 207 KB

This paper, Part 2 of a two part series, reviews and evaluates four (4) algorithms that identify fuzzy relational matrices by optimizing a user-speciΓΏed performance index [6,8,29,34]. The performance of the Recursive Parameter method [34] was unsatisfactory but the Probabilistic Descent [6], Neural