Search Heuristics
Search Heuristics is a computational strategy that belongs to the class of problem-solving methods in artificial intelligence and is distinguished by its use of domain-specific knowledge to guide the search process efficiently toward a solution, typically through approximate or rule-of-thumb techniques that trade optimality for speed.
1K
Publications
84.1K
Citations
2K
Authors
816
Institutions
Publications per year
2017–2026
223
Parents
1K
CD-Search: protein domain annotations on the fly
Aron Marchler‐Bauer, Stephen H. Bryant · Nucleic Acids Research · 2004 · 2.1K citations · Full text
1–5 of 1K
2K
15
h-index
14
h-index
13
h-index
13
h-index
13
h-index
1–5 of 2K
816
Carnegie Mellon University
Pittsburgh, United States
26 h-index
74 publications
5.7K citations

University of Alberta
Edmonton, Canada
22 h-index
67 publications
2.7K citations

University of Nottingham
Nottingham, United Kingdom
16 h-index
52 publications
2.3K citations
Ben-Gurion University of the Negev
Beersheba, Israel
14 h-index
43 publications
1.2K citations
University of California, Los Angeles
Los Angeles, United States
14 h-index
22 publications
3.4K citations
TU Dortmund University
Dortmund, Germany
13 h-index
25 publications
1.1K citations

University of Freiburg
Freiburg im Breisgau, Germany
13 h-index
27 publications
1.2K citations

University of Basel
Basel, Switzerland
12 h-index
35 publications
923 citations
1–8 of 816
27 publications · 879 citations
18
h-index
JAIR · 19 publications · 3.2K citations
17
h-index
16 publications · 3K citations
15
h-index
Repository · 18 publications · 509 citations
15
h-index
16 publications · 2.3K citations
15
h-index
1–5