DEPTH-1ST ITERATIVE-DEEPENING - AN OPTIMAL ADMISSIBLE TREE-SEARCH

被引：775

作者：

KORF, RE ^{[1
]}

机构：

[1] COLUMBIA UNIV,DEPT COMP SCI,NEW YORK,NY 10027

来源：

关键词：

D O I：

10.1016/0004-3702(85)90084-0

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

引用

页码：97 / 109

页数：13

共 18 条

[1]

Barr A, 1981, HDB ARTIFICIAL INTEL

[2]

BERLINER H, 1983, SEARCH ARTIFICIAL IN

[3]

BERLINER H, 1984, COMMUNICATION

[4]

BERLINER H, 1984, CMUCS84147 CARN MELL

[5]

Dechter R., 1983, AUG P NAT C ART INT, P95

[6]

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

[7]

Hopcroft J.E., 1979, INTRO AUTOMATA THEOR

[8]

KORF RE, 1985, LEARNING SOLVE PROBL

[9]

KORF RE, 1985, 9TH P INT JOINT C AR

[10] A HEURISTIC-SEARCH ALGORITHM WITH MODIFIABLE ESTIMATE [J].

MERO, L .