Abstraction Heuristics
Abstraction Heuristics is a heuristic function derived from a simplified model of the original problem space by suppressing certain details, thereby enabling more efficient search through the use of approximate solutions grounded in reduced state representations.
62
Publications
3.4K
Citations
101
Authors
63
Institutions
Publications per year
2017–2026
12
Parents
62
Efficient coflow scheduling with Varys
Mosharaf Chowdhury, Yuan Zhong, Ion Stoica · 2014 · 432 citations · Full text
Planning with Pattern Databases
Stefan Edelkamp · 2014 · 278 citations
Domain-independent construction of pattern database heuristics for cost-optimal planning
Patrik Haslum, Adi Botea, Malte Helmert et al. · 2007 · 188 citations
1–5 of 62
101
13
h-index
9
h-index
8
h-index
6
h-index
4
h-index
1–5 of 101
63

University of Basel
Basel, Switzerland
11 h-index
26 publications
663 citations
Technion – Israel Institute of Technology
Haifa, Israel
10 h-index
18 publications
1K citations

University of Freiburg
Freiburg im Breisgau, Germany
7 h-index
9 publications
946 citations

University of Alberta
Edmonton, Canada
5 h-index
10 publications
538 citations

Saarland University
Saarbrücken, Germany
5 h-index
6 publications
93 citations

Australian National University
Canberra, Australia
4 h-index
7 publications
656 citations

Universidad Carlos III de Madrid
Madrid, Spain
3 h-index
6 publications
108 citations
Columbia University
New York, United States
3 h-index
5 publications
844 citations
1–8 of 63
8 publications · 570 citations
8
h-index
JAIR · 6 publications · 228 citations
6
h-index
Conference · 6 publications · 141 citations
6
h-index
5 publications · 130 citations
5
h-index
3 publications · 226 citations
3
h-index
1–5