Parallel depth first search. Part II. Analysis

被引：1

作者：

Kumar, Vipin ^{[1
]}

Rao, V.Nageshwara ^{[1
]}

机构：

[1] Department of Computer Sciences, University of Texas at Austin, Austin, 78712, Texas, United States

来源：

关键词：

Isoefficiency Functions - Parallel Algorithms - Parallel Depth First Search - Work Distribution Schemes;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

(Edited Abstract)

引用

页码：501 / 519

共 50 条

[1] NOTE ON PARALLEL DEPTH FIRST SEARCH.
Zhang, Y.
BIT (Copenhagen), 1986, 26 (02): : 195 - 198
[2] A First Step in a Necessary Search.
Martin, Sara
EXTRAPOLATION, 2023, 64 (01) : 128 - 132
[3] Parallel Depth First Proof Number Search
Kaneko, Tomoyuki
PROCEEDINGS OF THE TWENTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-10), 2010, : 95 - 100
[4] PART II. STATISTICAL ANALYSIS
Mahalanobis, P. C.
Rao, C. Radhakrishna
SANKHYA, 1949, 9 : 111 - 180
[5] On the best search strategy in parallel branch‐and‐bound:Best‐First Search versus Lazy Depth‐First Search
J. Clausen
M. Perregaard
Annals of Operations Research, 1999, 90 : 1 - 17
[6] Parallel Depth-First Search for Directed Acyclic Graphs
Naumov, Maxim
Vrielink, Alysson
Garland, Michael
PROCEEDINGS OF IA3 2017: SEVENTH WORKSHOP ON IRREGULAR APPLICATIONS: ARCHITECTURES AND ALGORITHMS, 2017,
[7] A PARALLEL ALGORITHM FOR RECOGNIZING UNORDERED DEPTH-FIRST SEARCH
SCHEVON, CA
VITTER, JS
INFORMATION PROCESSING LETTERS, 1988, 28 (02) : 105 - 110
[8] CINF 30-Federated search. An in-depth introduction
Lederman, Abe
ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, 2009, 238
[9] Depth annotation of RNA folds for secondary structure motif search.
Ashlock, D
Schonfeld, J
PROCEEDINGS OF THE 2005 IEEE SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE IN BIOINFORMATICS AND COMPUTATIONAL BIOLOGY, 2005, : 38 - 45
[10] Single-agent parallel window search. A summary of results
1600, Morgan Kaufmann Publ Inc, San Mateo, CA, USA (01):