Randomized Parallel Search
Randomized Parallel Search is a parallel search algorithm that incorporates probabilistic decision-making into the exploration of the solution space, distinguishing itself from deterministic variants by using randomness to guide the selection and evaluation of candidate solutions across concurrent processes.
7
Publications
393
Citations
13
Authors
7
Institutions
Publications per year
2017–2026
1
Parents
7
A randomized parallel branch-and-bound procedure
Richard M. Karp, Yanjun Zhang · 1988 · 83 citations · Full text
1–5 of 7
13
2
h-index
2
h-index
1
h-index
1
h-index
1
h-index
1–5 of 13
7
University of California, Berkeley
Berkeley, United States
2 h-index
4 publications
516 citations
Brigham Young University
Provo, United States
1 h-index
2 publications
100 citations

École Normale Supérieure de Lyon
Lyon, France
1 h-index
1 publications
13 citations

Centre National de la Recherche Scientifique
Paris, France
1 h-index
2 publications
26 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
1 h-index
2 publications
26 citations
The University of Texas at Austin
Austin, United States
1 h-index
1 publications
50 citations

Adam Mickiewicz University in Poznań
Poznan, Poland
1 h-index
2 publications
40 citations
1–7 of 7
1 publications · 13 citations
1
h-index
JCGS · 1 publications · 50 citations
1
h-index
1 publications · 20 citations
1
h-index
1 publications · 30 citations
1
h-index
1 publications · 22 citations
1
h-index
1–5