微信服务号

微信订阅号

Home > Archive>Volume 6, Issue 3, 1995 >155-158
PDF HTML XML Export Cite reminder
STUDY OF COST-ERROR RELATIONSHIP IN A* TREE-SEARCHING ALGORITHM
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
    • |
  • Figures
    • |
  • Metrics
    • |
  • Reference
    • |
  • Related
    • |
  • Cited by
    • |
  • Materials
    • |
  • Comments
    Abstract:

    wo theorems of the relationships between the validity of admissible heuristic function h and the expected cost in the A* algorithm made by Pearl is introduced first.An additional assumption required for the validity of these two theorems is given and also be proved in the paper.

    Reference
    Related
    Cited by
Get Citation

金海,谢卫. A*树搜索算法代价与误差关系的研究.软件学报,1995,6(3):155-158

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:December 11,1992
  • Revised:June 25,1993
  • Adopted:
  • Online:
  • Published:
Links:Institute of Software, CASChina Computer FederationCASNSFC
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address：4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code：100190
Phone：010-62562563 Fax：010-62562533 Email：jos@iscas.ac.cn
Technical Support：Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063