GENERALIZED BEST-1ST SEARCH STRATEGIES AND THE OPTIMALITY OF A

被引：578

作者：

DECHTER, R

PEARL, J

机构：

[1] Univ of California, Los Angeles,, Cognitive Systems Lab, Los Angeles,, CA, USA, Univ of California, Los Angeles, Cognitive Systems Lab, Los Angeles, CA, USA

来源：

JOURNAL OF THE ACM | 1985年 / 32卷 / 03期

关键词：

D O I：

10.1145/3828.3830

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：505 / 536

页数：32

共 19 条

[1] SEARCH ALGORITHMS UNDER DIFFERENT KINDS OF HEURISTICS - A COMPARATIVE-STUDY
BAGCHI, A
MAHANTI, A
[J]. JOURNAL OF THE ACM, 1983, 30 (01) : 1 - 21
[2] Barr A, 1981, HDB ARTIFICIAL INTEL
[3] Dreyfus S. E., 1977, ART THEORY DYNAMIC P
[4] OPTIMALITY OF A
GELPERIN, D
[J]. ARTIFICIAL INTELLIGENCE, 1977, 8 (01) : 69 - 76
[5] HEURISTIC SEARCH UNDER CONDITIONS OF ERROR
HARRIS, LR
[J]. ARTIFICIAL INTELLIGENCE, 1974, 5 (03) : 217 - 234
[6] HART PE, 1968, IEEE T SYS SCI CYBER, V4, P100, DOI DOI 10.1109/TSSC.1968.300136
[7] POWER OF DOMINANCE RELATIONS IN BRANCH-AND-BOUND ALGORITHMS
IBARAKI, T
[J]. JOURNAL OF THE ACM, 1977, 24 (02) : 264 - 279
[8] SEARCHING FOR AN OPTIMAL PATH IN A TREE WITH RANDOM COSTS
KARP, RM
PEARL, J
[J]. ARTIFICIAL INTELLIGENCE, 1983, 21 (1-2) : 99 - 116
[9] BRANCH-AND-BOUND METHODS - A SURVEY
LAWLER, EL
WOOD, DE
[J]. OPERATIONS RESEARCH, 1966, 14 (04) : 699 - +
[10] COMPLEXITY OF ADMISSIBLE SEARCH ALGORITHMS
MARTELLI, A
[J]. ARTIFICIAL INTELLIGENCE, 1977, 8 (01) : 1 - 13

← 1 2 →