Parallel Search On Distributed Memory
Parallel Search On Distributed Memory is a computational method that enables concurrent exploration of search spaces across multiple processors with non-shared memory architectures, distinguished by its reliance on message-passing protocols to coordinate and synchronize search operations among distributed nodes.
11
Publications
345
Citations
31
Authors
13
Institutions
Publications per year
2017–2026
0
Parents
11
1–5 of 11
31
1 publications · 12 citations
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 31
13

The University of Texas System
Austin, United States
1 h-index
1 publications
21 citations
Kyushu University
Fukuoka, Japan
1 h-index
4 publications
72 citations
Technical University of Denmark
Kongens Lyngby, Denmark
1 h-index
1 publications
22 citations
University of California San Diego
San Diego, United States
1 h-index
3 publications
87 citations
University of California, Santa Barbara
Santa Barbara, United States
1 h-index
2 publications
80 citations
Massachusetts Institute of Technology
Cambridge, United States
1 h-index
1 publications
12 citations
California Institute of Technology
Pasadena, United States
1 h-index
1 publications
74 citations
École Polytechnique Fédérale de Lausanne
Lausanne, Switzerland
1 h-index
4 publications
88 citations
1–8 of 13
CABIOS · 1 publications · 21 citations
1
h-index
1 publications · 40 citations
1
h-index
1 publications · 21 citations
1
h-index
1 publications · 29 citations
1
h-index
1 publications · 61 citations
1
h-index
1–5