COMPLEXITY OF ADMISSIBLE SEARCH ALGORITHMS

被引：79

作者：

MARTELLI, A ^{[1
]}

机构：

[1] CNR,IST ELABORAZ INFORMA,I-56100 PISA,ITALY

来源：

关键词：

D O I：

10.1016/0004-3702(77)90002-9

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

引用

页码：1 / 13

页数：13

共 13 条

[1] HEURISTIC SEARCH UNDER CONDITIONS OF ERROR
HARRIS, LR
[J]. ARTIFICIAL INTELLIGENCE, 1974, 5 (03) : 217 - 234
[2] HART PE, 1972, SIGART B, P28
[3] HART PE, 1968, IEEE T SYS SCI CYBER, V4, P100, DOI DOI 10.1109/TSSC.1968.300136
[4] NOTE ON DIJKSTRAS SHORTEST PATH ALGORITHM
JOHNSON, DB
[J]. JOURNAL OF THE ACM, 1973, 20 (03) : 385 - 388
[5] BRANCH-AND-BOUND METHODS - A SURVEY
LAWLER, EL
WOOD, DE
[J]. OPERATIONS RESEARCH, 1966, 14 (04) : 699 - +
[6] MARTELLI A, 1972, APR P INT COMP S VEN, P59
[7] MARTELLI A, 1975, 4TH P INT JOINT C AR, P345
[8] MARTELLI A, 1975, NIB751 IEI
[9] MICHIE D, 1969, MACH INTELL, V5, P301
[10] Nilsson N.J., 1971, PROBLEM SOLVING METH