SEARCH ALGORITHMS UNDER DIFFERENT KINDS OF HEURISTICS - A COMPARATIVE-STUDY

被引:35
作者
BAGCHI, A
MAHANTI, A
机构
关键词
D O I
10.1145/322358.322359
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:1 / 21
页数:21
相关论文
共 7 条
[1]   OPTIMALITY OF A [J].
GELPERIN, D .
ARTIFICIAL INTELLIGENCE, 1977, 8 (01) :69-76
[2]   HEURISTIC SEARCH UNDER CONDITIONS OF ERROR [J].
HARRIS, LR .
ARTIFICIAL INTELLIGENCE, 1974, 5 (03) :217-234
[3]   POWER OF DOMINANCE RELATIONS IN BRANCH-AND-BOUND ALGORITHMS [J].
IBARAKI, T .
JOURNAL OF THE ACM, 1977, 24 (02) :264-279
[4]   COMPLEXITY OF ADMISSIBLE SEARCH ALGORITHMS [J].
MARTELLI, A .
ARTIFICIAL INTELLIGENCE, 1977, 8 (01) :1-13
[5]  
Nilson N., 1971, PROBLEM SOLVING METH
[6]  
Nilsson N.J., 1980, PRINCIPLES ARTIFICIA
[7]  
SLAGLE JR, 1971, ARTIFICIAL INTELLIGE