𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Is there a search in fixed-set memory search?

✍ Scribed by Michael A. Stadler; Gordon D. Logan


Book ID
111515792
Publisher
Psychonomic Society Publications
Year
1989
Tongue
English
Weight
778 KB
Volume
17
Category
Article
ISSN
0090-502X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


cover
✍ Griffin, Pamela πŸ“‚ Fiction πŸ“… 2011 πŸ› Barbour Publishing, Inc. 🌐 en-ca βš– 118 KB
Heuristic search in restricted memory
✍ P.P. Chakrabarti; S. Ghose; A. Acharya; S.C. de Sarkar πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 979 KB

Thts paper presents heurlsttc search algortthms whtch work wtthm memory constramts These algortthms, MA\* (for ordinary graphs) and MAO\* (for AND~OR graphs) guarantee admtsstble soluttons wlthm spectfied memory hmltattons (above the rnmtmum requtred) The memory versus node expanstons tradeoff ts an