DISTRIBUTED GAME-TREE SEARCH

被引：8

作者：

FELDMANN, R

MONIEN, B

MYSLIWIETZ, P

VORNBERGER, O

机构：

[1] UNIV GESAMTHSCH PADERBORN,DEPT MATH & COMP SCI,D-4790 PADERBORN,FED REP GER

[2] UNIV OSNABRUCK,DEPT MATH & COMP SCI,D-4500 OSNABRUCK,FED REP GER

来源：

ICCA JOURNAL | 1989年 / 12卷 / 02期

关键词：

D O I：

10.3233/ICG-1989-12203

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：65 / 73

页数：9

共 12 条

[1] AKL SG, 1980, IEEE INT C PARALLEL, P231
[2] BRATKO I, 1982, ADV COMPUTER CHESS, V3, P31
[3] FELDMANN R, 1989, IN PRESS PARALLEL AL
[4] FERGUSON C, 1988, 7TH P AAAI 88 NAT C, V2, P128
[5] FINKEL RA, 1980, IEEE INT C PARALLEL, P235
[6] ANALYSIS OF ALPHA-BETA PRUNING
KNUTH, DE
MOORE, RW
[J]. ARTIFICIAL INTELLIGENCE, 1975, 6 (04) : 293 - 326
[7] PARALLEL BRANCH-AND-BOUND FORMULATIONS FOR AND OR TREE-SEARCH
KUMAR, V
KANAL, LN
[J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1984, 6 (06) : 768 - 778
[8] Marsland T.A., 1986, ADV COMPUTER CHESS, V4, P37
[9] PARALLEL GAME-TREE SEARCH
MARSLAND, TA
POPOWICH, F
[J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1985, 7 (04) : 442 - 452
[10] MONIEN B, 1987, 1987 INT WORKSH PAR, P60