| OPEN表和CLOSED表的合一 |
| |
| 引用本文： | 冯乃勤,王岁花,郑延斌,冯国燚.OPEN表和CLOSED表的合一[J].计算机工程与应用,2003,39(16):100-101. |
| |
| 作者姓名： | 冯乃勤 王岁花 郑延斌 冯国燚 |
| |
| 作者单位： | 1. 河南师范大学计算机科学系,新乡,453002
2. 湘潭大学,湘潭,411200 |
| |
| 基金项目： | 河南省自然科学基金资助(编号:0211050800) |
| |
| 摘 要： | 在人工智能传统的搜索方法中,一直是将OPEN表和CLOSED表分开的。这不仅增加了搜索算法的复杂性,久而久之,也许禁锢了人们的思想。文章试图改变这种状况,提出了一种与众不同的新思路,巧妙地将OPEN表和CLOSED表合二为一,减少了一些工作量,在一定程度上降低了算法的复杂性。
|
| 关 键 词： | 搜索 OPEN表 CLOSED表 算法复杂性 |
| 文章编号： | 1002-8331-(2003)16-0100-02 |
| 修稿时间： | 2003年3月1日 |
The Unification of List Open and List Closed |
| |
| Feng Naiqin,Wang Suihua,Zheng Yanbin,Feng Guoyi.The Unification of List Open and List Closed[J].Computer Engineering and Applications,2003,39(16):100-101. |
| |
| Authors: | Feng Naiqin Wang Suihua Zheng Yanbin Feng Guoyi |
| |
| Affiliation: | Feng Naiqin 1 Wang Suihua 1 Zheng Yanbin 1 Feng Guoyi 21 |
| |
| Abstract: | In the traditional search algorithm of artificial intelligence,the ordered list called OPEN and the ordered list called CLOSED are always separated.This has not only increased its complexity of search algorithm,but also may bind man's hand and foot as time passes.In this paper,an instinctive new idea is put forward,trying to change the current situation.It combines OPEN with CLOSED ingeniously;thus the amount of work done by the algorithm is decreased and the complexity of the algorithm is reduced to some extent. |
| |
| Keywords: | Search List OPEN List CLOSED Algorithm complexity |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
