SOME RECENT RESULTS IN HEURISTIC-SEARCH THEORY

被引:14
作者
PEARL, J [1 ]
机构
[1] UNIV CALIF LOS ANGELES,DEPT COMP SCI,COGNIT SCI LAB,LOS ANGELES,CA 90024
关键词
D O I
10.1109/TPAMI.1984.4767470
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
引用
收藏
页码:1 / 13
页数:13
相关论文
共 28 条
[1]   SEARCH ALGORITHMS UNDER DIFFERENT KINDS OF HEURISTICS - A COMPARATIVE-STUDY [J].
BAGCHI, A ;
MAHANTI, A .
JOURNAL OF THE ACM, 1983, 30 (01) :1-21
[2]   BRANCHING FACTOR OF ALPHA-BETA PRUNING ALGORITHM [J].
BAUDET, GM .
ARTIFICIAL INTELLIGENCE, 1978, 10 (02) :173-199
[3]  
BEAL D, 1980, ADV COMPUTER CHESS, V2
[4]   B-STAR TREE SEARCH ALGORITHM - BEST-1ST PROOF PROCEDURE [J].
BERLINER, H .
ARTIFICIAL INTELLIGENCE, 1979, 12 (01) :23-40
[5]  
Dechter R., 1983, AUG P NAT C ART INT, P95
[6]  
Fuller S. H., 1973, ANAL ALPHA BETA PRUN
[7]  
GASCHNIG J, 1979, CMUCS79124 CARN MELL
[8]   OPTIMALITY OF A [J].
GELPERIN, D .
ARTIFICIAL INTELLIGENCE, 1977, 8 (01) :69-76
[9]  
HART PE, 1968, IEEE T SYST SCI CYBE, V4, P1000
[10]   PROBABILISTIC ANALYSIS OF THE COMPLEXITY OF A-STAR [J].
HUYN, N ;
DECHTER, R ;
PEARL, J .
ARTIFICIAL INTELLIGENCE, 1980, 15 (03) :241-254