Studies in Semi-Admissible Heuristics
From MaRDI portal
Publication:3942411
DOI10.1109/TPAMI.1982.4767270zbMath0483.68061WikidataQ63378958 ScholiaQ63378958MaRDI QIDQ3942411
No author found.
Publication date: 1982
Published in: IEEE Transactions on Pattern Analysis and Machine Intelligence (Search for Journal in Brave)
Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)
Related Items (10)
The role of relevance in explanation. I: Irrelevance as statistical independence ⋮ Weighted \(A^*\) search - unifying view and application ⋮ Exploiting case-based independence for approximating marginal probabilities ⋮ Generalized best first search using single and multiple heuristics ⋮ Potential-based bounded-cost search and anytime non-parametric A* ⋮ Model-based stroke extraction and matching for handwritten Chinese character recognition ⋮ A Reach and Bound algorithm for acyclic dynamic-programming networks ⋮ Probably bounded suboptimal heuristic search ⋮ Efficient Large-Scale Multi-Drone Delivery using Transit Networks ⋮ Truncated incremental search
This page was built for publication: Studies in Semi-Admissible Heuristics
