Heuristic Scheduling
Heuristic Scheduling is an instruction scheduling technique that belongs to the class of approximation methods and is distinguished by its use of practical, experience-based rules to efficiently explore the solution space when finding optimal or near-optimal execution sequences for instructions in the absence of guaranteed optimality.
1.4K
Publications
68.7K
Citations
3.6K
Authors
1.2K
Institutions
Publications per year
2017–2026
388
1.4K
1–5 of 1.4K
3.6K
6
h-index
6
h-index
6
h-index
6
h-index
6
h-index
1–5 of 3.6K
1.2K
Tsinghua University
Beijing, China
20 h-index
74 publications
2.7K citations

Hong Kong Polytechnic University
Hong Kong, Hong Kong
15 h-index
28 publications
1.4K citations

City University of Hong Kong
Hong Kong, Hong Kong
14 h-index
31 publications
904 citations
Purdue University West Lafayette
West Lafayette, United States
14 h-index
46 publications
4K citations
Stanford University
Stanford, United States
14 h-index
22 publications
817 citations

Centre National de la Recherche Scientifique
Paris, France
13 h-index
30 publications
1.1K citations
National University of Singapore
Singapore, Singapore
13 h-index
25 publications
2.1K citations

University of Nottingham
Nottingham, United Kingdom
12 h-index
28 publications
1.2K citations
1–8 of 1.2K
85 publications · 3.9K citations
36
h-index
30 publications · 3.8K citations
26
h-index
28 publications · 2.1K citations
23
h-index
20 publications · 3.5K citations
19
h-index
22 publications · 583 citations
17
h-index
1–5