INCREASING TREE-SEARCH EFFICIENCY FOR CONSTRAINT SATISFACTION PROBLEMS

被引：554

作者：

HARALICK, RM ^{[1
]}

ELLIOTT, GL ^{[1
]}

机构：

[1] VIRGINIA POLYTECH INST & STATE UNIV,DEPT COMP SCI,BLACKSBURG,VA 24061

来源：

关键词：

D O I：

10.1016/0004-3702(80)90051-X

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

引用

页码：263 / 313

页数：51

共 17 条

[1] BARROW HG, 1976, AT121 SRI STANF RES
[2] Gaschnig J, 1977, P INT JOINT C ART IN, P457
[3] GASCHNIG J, 1978, 2ND P NAT C CAN SOC
[4] Gaschnig J. G., 1979, THESIS CARNEGIE MELL
[5] REDUCTION OPERATIONS FOR CONSTRAINT SATISFACTION
HARALICK, RM
DAVIS, LS
ROSENFELD, A
MILGRAM, DL
[J]. INFORMATION SCIENCES, 1978, 14 (03) : 199 - 219
[6] HARALICK RM, 1979, IEEE T PATTERN ANAL, V1
[7] HARALICK RM, 1978, MACHINE VISION
[8] HARALICK RM, 1980, IEEE T PATTERN ANAL, V2
[9] Harary F., 1969, GRAPH THEORY, DOI DOI 10.21236/AD0705364
[10] ESTIMATING EFFICIENCY OF BACKTRACK PROGRAMS
KNUTH, DE
[J]. MATHEMATICS OF COMPUTATION, 1975, 29 (129) : 121 - 136