| 一个新的启发式搜索算法 |
| |
| 引用本文： | 张伟. 一个新的启发式搜索算法[J]. 辽宁大学学报(自然科学版), 1989, 16(1): 29-35 |
| |
| 作者姓名： | 张伟 |
| |
| 作者单位： | 浙江大学人工智能研究所 |
| |
| 摘 要： | 本文提出一个新的启发式搜索算法,它可以在搜索过程中不断改善启发函数h,使最坏复杂度降为O(N)(N是被搜索图的大小)。本文还指了L.Mcro对“无普遍最优算法”的证明中的漏洞,并给出了新的证明。
|
| 关 键 词： | 启发式搜取 搜索算法 复杂度 |
A Linear Heuristic Search Algorithm |
| |
| Zhang Wei Zheiiang University. A Linear Heuristic Search Algorithm[J]. Journal of Liaoning University(Natural Sciences Edition), 1989, 16(1): 29-35 |
| |
| Authors: | Zhang Wei Zheiiang University |
| |
| Affiliation: | Zhang Wei Zheiiang University |
| |
| Abstract: | In this paper. a new heuristic search algorithm is presented. It is able to improve the heuristic function during the searching and it has an O(N) worst-case complexity ( N is the size of the graph searched). Another result of the paper is that a new proof for "No overall optimal algorithm" has been obtained. |
| |
| Keywords: | Heuristic search complexity |
| 本文献已被 CNKI 维普 等数据库收录！ |
