𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Perimeter search in restricted memory

✍ Scribed by G. Manzini


Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
589 KB
Volume
32
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


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