A correction to: ``Agent searching in a tree and the optimality of iterative deepening

DOI10.1016/0004-3702(95)00089-WzbMath1012.68532OpenAlexW2093020477MaRDI QIDQ1855235

Pallab Dasgupta, Partha Pratim Chakrabarti, S. C. de Sarkar

Publication date: 4 February 2003

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0004-3702(95)00089-w

Mathematics Subject Classification ID

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

Related Items (2)

Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs ⋮ Impact of knowledge on the cost of treasure hunt in trees

Cites Work

• Searching in the plane
• Agent searching in a tree and the optimality of iterative deepening

This page was built for publication: A correction to: ``Agent searching in a tree and the optimality of iterative deepening