Bound Search
Bound Search is a searching algorithm that restricts the search space by establishing upper and lower bounds to systematically eliminate regions where the target cannot lie, thereby improving efficiency in locating the desired element.
13
Publications
624
Citations
31
Authors
20
Institutions
Publications per year
2017–2026
3
Parents
13
Particle Swarm Optimization in High-Dimensional Bounded Search Spaces
Sabine Helwig, Rolf Wanka · 2007 · 77 citations
1–5 of 13
31
Friedrich-Alexander-Universität Erlangen-Nürnberg, Germany
2 publications · 245 citations
2
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 31
20
Friedrich-Alexander-Universität Erlangen-Nürnberg
Erlangen, Germany
2 h-index
3 publications
322 citations
University of Southern California
Los Angeles, United States
1 h-index
2 publications
60 citations
Karlsruhe Institute of Technology
Karlsruhe, Germany
1 h-index
1 publications
168 citations
North Carolina State University
Raleigh, United States
1 h-index
2 publications
58 citations
Aselsan (Turkey)
Ankara, Turkey
1 h-index
1 publications
65 citations
Institució Catalana de Recerca i Estudis Avançats
Barcelona, Spain
1 h-index
1 publications
19 citations
Instituto Superior Técnico
Lisbon, Portugal
1 h-index
1 publications
65 citations

University of Alberta
Edmonton, Canada
1 h-index
2 publications
52 citations
1–8 of 20
1 publications · 30 citations
1
h-index
TSE · 1 publications · 19 citations
1
h-index
1 publications · 168 citations
1
h-index
1 publications · 29 citations
1
h-index
1 publications · 26 citations
1
h-index
1–5