HEURISTIC-SEARCH IN RESTRICTED MEMORY

被引：62

作者：

CHAKRABARTI, PP

GHOSE, S

ACHARYA, A

DESARKAR, SC

机构：

来源：

ARTIFICIAL INTELLIGENCE | 1989年 / 41卷 / 02期

关键词：

D O I：

10.1016/0004-3702(89)90010-6

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

引用

页码：197 / 221

页数：25

共 10 条

[1] 3 APPROACHES TO HEURISTIC-SEARCH IN NETWORKS [J].

BAGCHI, A ;

MAHANTI, A .

JOURNAL OF THE ACM, 1985, 32 (01) :1-27

[2]

Bhattacharya S., 1986, Proceedings AAAI-86: Fifth National Conference on Artificial Intelligence, P163

[3]

CHAKARABARTI PP, 1988, THESIS INDIAN I TECH

[4]

Chakrabarti P., 1988, ARTIF INTELL, V34, P97

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

IBARAKI, T .

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

[6] DEPTH-1ST ITERATIVE-DEEPENING - AN OPTIMAL ADMISSIBLE TREE-SEARCH [J].

KORF, RE .

ARTIFICIAL INTELLIGENCE, 1985, 27 (01) :97-109

[7] LOW OVERHEAD ALTERNATIVES TO SSS [J].

MARSLAND, TA ;

REINEFELD, A ;

SCHAEFFER, J .

ARTIFICIAL INTELLIGENCE, 1987, 31 (02) :185-199

[8] GENERAL BRANCH AND BOUND, AND ITS RELATION TO A-STAR AND AO-STAR [J].

NAU, DS ;

KUMAR, V ;

KANAL, L .

ARTIFICIAL INTELLIGENCE, 1984, 23 (01) :29-58

[9]

Nilsson N.J., 1980, PRINCIPLES ARTIFICIA

[10]

Pearl J., 1984, HEURISTICS

← 1 →