Effective use of memory in iterative deepening search

DOI10.1016/0020-0190(92)90131-EMaRDI QIDQ1198022zbMATH OpenFDO

Authors U. K. Sarkar, S. De Sarkar, P. P. Chakrabarti, Sujoy Ghose

Publication date 16 January 1993

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(92)90131-E

zbMATH Keywords

\(A^*\)\(IDA^*\)approximation algorithmflow-shop scheduling problemtree search

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• scientific article; zbMATH DE number 2063052
• Heuristic search in restricted memory
• Efficient retrieval from sparse associative memory
• Memory and learning in metaheuristics
• Learning for efficient search
• Iterative Deepening Dynamically Improved Bounds Bidirectional Search
• scientific article; zbMATH DE number 6001451

Cites work

• Depth-first iterative-deepening: An optimal admissible tree search
• Generalized best-first search strategies and the optimality of A*
• Heuristic search in restricted memory
• scientific article; zbMATH DE number 3657150 (Why is no real title available?)
• Increasing search efficiency using multiple heuristics
• Reducing reexpansions in iterative-deepening search by controlling cutoff bounds
• Three approaches to heuristic search in networks

Cited in

(8)

• Reducing reexpansions in iterative-deepening search by controlling cutoff bounds
• On the asymptotic performance of IDA
• \(\text{BIDA}^*\): An improved perimeter search algorithm
• Iterative-deepening search with on-line tree size prediction
• scientific article; zbMATH DE number 4162302 (Why is no real title available?)
• scientific article; zbMATH DE number 4162303 (Why is no real title available?)
• PARALLEL IMPRECISE ITERATIVE DEEPENING FOR COMBINATORIAL OPTIMIZATION
• Heuristic search strategies for multiobjective state space search

This page was built for publication: Effective use of memory in iterative deepening search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1198022)