Dynamic Heuristic Search
Dynamic Heuristic Search is a heuristic search method that adapts its evaluation function or search strategy during execution based on changing problem conditions or accumulated search experience.
120
Publications
6.1K
Citations
340
Authors
186
Institutions
Publications per year
2017–2026
35
Parents
120
Anytime dynamic A*: an anytime, replanning algorithm
Maxim Likhachev, Dave Ferguson, Geoff Gordon et al. · 2005 · 538 citations
Active sequential hypothesis testing
Mohammad Naghshvar, Tara Javidi · The Annals of Statistics · 2013 · 255 citations · Full text
Dynamic search in fireworks algorithm
Shaoqiu Zheng, Andreas Janecek, Junzhi Li et al. · 2014 · 170 citations
1–5 of 120
340
3
h-index
3
h-index
3
h-index
2
h-index
2
h-index
1–5 of 340
186
Carnegie Mellon University
Pittsburgh, United States
5 h-index
11 publications
3.3K citations

University of Nottingham
Nottingham, United Kingdom
3 h-index
6 publications
142 citations

Central South University
Changsha, China
3 h-index
4 publications
60 citations
Georgia Institute of Technology
Atlanta, United States
3 h-index
5 publications
360 citations

Universiti Sains Malaysia
George Town, Malaysia
2 h-index
3 publications
43 citations
National Agency for New Technologies, Energy and Sustainable Economic Development
Rome, Italy
2 h-index
2 publications
126 citations
University of New Hampshire at Manchester
Manchester, United States
2 h-index
4 publications
102 citations

Suez University
Suez, Egypt
2 h-index
3 publications
85 citations
1–8 of 186
4 publications · 76 citations
4
h-index
3 publications · 128 citations
3
h-index
2 publications · 119 citations
2
h-index
2 publications · 45 citations
2
h-index
2 publications · 35 citations
2
h-index
1–5