✦ LIBER ✦

Utility of pathmax in partial order heuristic search

✍ Scribed by Pallab Dasgupta; P.P Chakrabarti; S.C DeSarkar

Book ID: 107766259
Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 508 KB
Volume: 55
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(95)00086-r

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Searching in 2-dimensional partial order

Searching in 2-dimensional partial orders

✍ George Steiner 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 580 KB

Computer generation of Pauling bond orde

Computer generation of Pauling bond orders using heuristic search

✍ Balakrishnarajan, M. M.; Venuvanalingam, P. 📂 Article 📅 1995 🏛 American Chemical Society 🌐 English ⚖ 610 KB

Tabu search heuristics for the order bat

Tabu search heuristics for the order batching problem in manual order picking systems

✍ Sebastian Henn; Gerhard Wäscher 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 530 KB

Some models of noise signals and heurist

Some models of noise signals and heuristic search for weighted-order statistics

✍ V.I. Znak 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 553 KB

Existence of a utility in infinite dimen

Existence of a utility in infinite dimensional partially ordered spaces

✍ Yakar Kannai 📂 Article 📅 1963 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 287 KB

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