HEURISTIC SEARCH VIEWED AS PATH FINDING IN A GRAPH

被引：219

作者：

POHL, I ^{[1
]}

机构：

[1] IBM,THOMAS J WATSON RES CTR,YORKTOWN HTS,NY

来源：

关键词：

D O I：

10.1016/0004-3702(70)90007-X

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

引用

页码：193 / 204

页数：12

共 24 条

[1] EXPERIMENTS WITH GRAPH TRAVERSER PROGRAM [J].

DORAN, JE ;

MICHIE, D .

PROCEEDINGS OF THE ROYAL SOCIETY OF LONDON SERIES A-MATHEMATICAL AND PHYSICAL SCIENCES, 1966, 294 (1437) :235-&

[2]

DREYFUS D, 1969, OPERATIONS RESEARCH, V17, P395

[3] SUFFICIENT CONDITIONS FOR SUCCESS OF GPS [J].

ERNST, GW .

[4]

FRAZER WD, 1968, TR74 PRINC U DEP EL

[5]

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

[6] BRANCH-AND-BOUND METHODS - A SURVEY [J].

LAWLER, EL ;

WOOD, DE .

[7]

MICHIE D, 1969, 19 U ED DEP MACH INT

[8]

MICHIE D, 1969, MACH INTELL, V5, P301

[9]

MOORE EF, 1959, 1957 P INT S THEOR S, P285

[10]

Newell A., 1963, COMPUT THOUGHT, P279