KNOWLEDGE VERSUS SEARCH - A QUANTITATIVE-ANALYSIS USING A-STAR

被引：18

作者：

PEARL, J

机构：

来源：

关键词：

D O I：

10.1016/0004-3702(83)90013-9

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

引用

页码：1 / 13

页数：13

共 15 条

[1] ADMISSIBLE AND OPTIMAL ALGORITHM FOR SEARCHING AND/OR GRAPHS [J].

CHANG, CL ;

SLAGLE, JR .

[2]

Gaschnig J. G., 1979, THESIS CARNEGIE MELL

[3] OPTIMALITY OF A [J].

GELPERIN, D .

[4] HEURISTIC SEARCH UNDER CONDITIONS OF ERROR [J].

HARRIS, LR .

[5]

HART PE, 1968, IEEE T SYS SCI CYBER, V4, P100, DOI DOI 10.1109/TSSC.1968.300136

[6] PROBABILISTIC ANALYSIS OF THE COMPLEXITY OF A-STAR [J].

HUYN, N ;

DECHTER, R ;

PEARL, J .

[7] DEPTH-M SEARCH IN BRANCH-AND-BOUND ALGORITHMS [J].

IBARAKI, T .

INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES, 1978, 7 (04) :315-343

[8] COMPLEXITY OF ADMISSIBLE SEARCH ALGORITHMS [J].

MARTELLI, A .

[9]

MUNYER J, 1976, HP762 U CAL INF SCI

[10]

Nilsson N.J., 1980, PRINCIPLES ARTIFICIA