NETWORK-BASED HEURISTICS FOR CONSTRAINT-SATISFACTION PROBLEMS

被引：207

作者：

DECHTER, R ^{[1
]}

PEARL, J ^{[1
]}

机构：

[1] HUGHES AIRCRAFT CO,CTR ARTIFICIAL INTELLIGENCE,CALABASAS,CA 91302

来源：

ARTIFICIAL INTELLIGENCE | 1987年 / 34卷 / 01期

关键词：

* This work was supported in part by the National Science Foundation; Grant #DCR 85-01234. Artificial Intelligence 34 (1988) 1-38 0004-3702/88/$3.50 © 1988; Elsevier Science Publishers B.V. (North-Holland);

D O I：

10.1016/0004-3702(87)90002-6

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

引用

页码：1 / 38

页数：38

共 39 条

[1]

ARNBORG S, 1985, BIT, V25, P2, DOI 10.1007/BF01934985

[2]

Bertele Umberto, 1972, NONSERIAL DYNAMIC PR

[3]

BRUYNOOGHE M, 1984, IMPLEMENTATIONS PROL, P194

[4]

Carbonell J.G., 1983, MACH LEARN, P3, DOI [10.1016/B978-0-08-051054-5.50005-4, DOI 10.1016/B978-0-08-051054-5.50005-4]

[5]

COX PT, 1984, IMPLEMENTATIONS PROL, P216

[6]

DECHTER A, 1987, P AAAI 87 SEATTLE

[7]

DECHTER R, UCLAENGREP8497

[8]

DECHTER R, 1985, P IJCAI 85, P1066

[9]

DECHTER R, 1987, R92 U CAL LOS ANG CO

[10]

DECHTER R, 1986, P AAAI 86 PHILADELPH

← 1 2 3 4 →