๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Heuristic search in restricted memory

โœ Scribed by P.P. Chakrabarti; S. Ghose; A. Acharya; S.C. de Sarkar

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
979 KB
Volume
41
Category
Article
ISSN
0004-3702

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 analyzed for the worst ca~e In the case of ordmary graphs, some expertments usmg the Ftfteen Puzzle problem are carried out under vartous prunmg condmons These parametertzed algortthms are found to encompass a wide class of best frst search algortthms Arttfictal huelhgence 41 (1989/90

๐Ÿ“œ SIMILAR VOLUMES

Heuristic search in artificial intellige
Heuristic search in artificial intelligence
โœ Weixiong Zhang; Rina Dechter; Richard E. Korf ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 41 KB
Heuristic search in artificial intellige
Heuristic search in artificial intelligence
โœ Weixiong Zhang; Rina Dechter; Richard E. Korf ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 41 KB

In his 1950 paper entitled, "Programming a Computer to Play Chess" [3], Shannon laid out the theory of minimax search with bounded lookahead and static heuristic evaluation, the basis of almost all subsequent work on two-player games. Along with Allen Newell, Herbert Simon established the idea of he

Multiobjective Heuristic Search in AND/O
Multiobjective Heuristic Search in AND/OR Graphs
โœ Pallab Dasgupta; P.P. Chakrabarti; S.C. DeSarkar ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 249 KB

The multiobjective search model is a framework for solving multi-criteria optimization problems using heuristic search techniques. In this framework, the different non-commensurate optimization criteria are mapped into distinct dimensions of a vector valued cost structure and partial order search te