用于改进搜索的小桶启发式算法
Mini-Bucket Heuristics for Improved Search
摘要:
这篇论文是两篇系列论文中的第二篇,评估了一种机械地生成搜索引擎的新方案的力量。最近推出的一种近似方案,称为小桶消除的算法。第一篇论文介绍了这个想法,并在分支定界搜索中对其进行了评估。在本文中,这一想法在最佳优先搜索中得到了进一步的扩展和评估。编码和医疗诊断问题,使用不同的强度的小桶算法进行比较。我们的研究结果表明,一个有效的搜索方案,允许控制预处理(启发式生成)和搜索之间的权衡。最佳优先搜索的性能优于分支定界,当提供良好的算法,和足够的内存空间。
英文摘要:
The paper is a second in a series of two papers evaluating the power of a new scheme that generates search heuristics mechanically. The heuristics are extracted from an approximation scheme called mini-bucket elimination that was recently introduced. The first paper introduced the idea and evaluated it within Branch-and-Bound search. In the current paper the idea is further extended and evaluated within Best-First search. The resulting algorithms are compared on coding and medical diagnosis problems, using varying strength of the mini-bucket heuristics. Our results demonstrate an effective search scheme that permits controlled tradeoff between preprocessing (for heuristic generation) and search. Best-first search is shown to outperform Branch-and-Bound, when supplied with good heuristics, and sufficient memory space.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。