Probabilistic Search
Probabilistic Search is a searching algorithm that, unlike deterministic methods, employs probabilistic models to guide the exploration of the search space by incorporating randomness and likelihood estimates to improve the efficiency or effectiveness of locating solutions.
286
Publications
24.8K
Citations
659
Authors
297
Institutions
Publications per year
2017–2026
36
Parents
286
Fred Glover · INFORMS Journal on Computing · 1989 · 5K citations
Optimizing the success of random searches
G. M. Viswanathan, Sergey V. Buldyrev, Shlomo Havlin et al. · Nature · 1999 · 1.5K citations
Random Search and Insect Population Models
David J. Rogers · Journal of Animal Ecology · 1972 · 1.2K citations
Life Sciences, Biology, Entomology +12
1–5 of 286
659
6
h-index
5
h-index
5
h-index
4
h-index
4
h-index
1–5 of 659
297

Centre National de la Recherche Scientifique
Paris, France
9 h-index
21 publications
1K citations
University of California, Berkeley
Berkeley, United States
8 h-index
19 publications
2.7K citations

Naval Postgraduate School
Monterey, United States
6 h-index
8 publications
242 citations

Tanta University
Tanta, Egypt
6 h-index
10 publications
186 citations

University of Minnesota
Minneapolis, United States
5 h-index
8 publications
160 citations
George Mason University
Fairfax, United States
5 h-index
13 publications
317 citations

Hong Kong Polytechnic University
Hong Kong, Hong Kong
5 h-index
10 publications
609 citations
University of Illinois Urbana-Champaign
Urbana, United States
5 h-index
9 publications
2.8K citations
1–8 of 297
11 publications · 804 citations
11
h-index
5 publications · 281 citations
5
h-index
4 publications · 103 citations
4
h-index
3 publications · 69 citations
3
h-index
3 publications · 87 citations
3
h-index
1–5