PARALLEL BRANCH-AND-BOUND FORMULATIONS FOR AND OR TREE-SEARCH

被引：33

作者：

KUMAR, V

KANAL, LN

机构：

[1] UNIV MARYLAND,CTR COMP SCI,COLLEGE PK,MD 20742

[2] LNK CORP,SILVER SPRING,MD

来源：

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE | 1984年 / 6卷 / 06期

关键词：

D O I：

10.1109/TPAMI.1984.4767600

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

引用

页码：768 / 778

页数：11

共 40 条

[1] DESIGN, ANALYSIS, AND IMPLEMENTATION OF A PARALLEL TREE-SEARCH ALGORITHM [J].

AKL, SG ;

BARNARD, DT ;

DORAN, RJ .

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1982, 4 (02) :192-203

[2] A NOTE ON BRANCH-AND-BOUND PRINCIPLE [J].

BALAS, E .

OPERATIONS RESEARCH, 1968, 16 (02) :442-&

[3]

BAUDET G, 1978, THESIS CARNEGIEMELLO

[4] B-STAR TREE SEARCH ALGORITHM - BEST-1ST PROOF PROCEDURE [J].

BERLINER, H .

ARTIFICIAL INTELLIGENCE, 1979, 12 (01) :23-40

[5]

CAMPBELL M, 1981, 818 U ALB DEP COMP S

[6]

ELDESSOUKI OI, 1980, IEEE T COMPUT, V29, P818, DOI 10.1109/TC.1980.1675681

[7] PARALLELISM IN ALPHA-BETA SEARCH [J].

FINKEL, RA ;

FISHBURN, JP .

ARTIFICIAL INTELLIGENCE, 1982, 19 (01) :89-106

[8] IMPROVED SPEEDUP BOUNDS FOR PARALLEL ALPHA-BETA SEARCH [J].

FINKEL, RA ;

FISHBURN, JP .

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1983, 5 (01) :89-92

[9] EQUIVALENCE BETWEEN AND/OR GRAPHS AND CONTEXT-FREE GRAMMARS [J].

HALL, PAV .

COMMUNICATIONS OF THE ACM, 1973, 16 (07) :444-445

[10] POWER OF DOMINANCE RELATIONS IN BRANCH-AND-BOUND ALGORITHMS [J].

IBARAKI, T .

JOURNAL OF THE ACM, 1977, 24 (02) :264-279

← 1 2 3 4 →