Heuristic Instruction Selection
Heuristic Instruction Selection is an instruction selection method that employs heuristic rules or approximations to efficiently map intermediate representations to target machine instructions, distinguishing itself from optimal but computationally expensive approaches by prioritizing practical runtime performance and scalability in code generation.
20
Publications
829
Citations
47
Authors
25
Institutions
Publications per year
2017–2026
0
Parents
20
Weihua Niu, Dan Liu · Psychology of Aesthetics Creativity and the Arts · 2009 · 83 citations
Instruction selection using binate covering for code size optimization
Stan Liao, Srinivas Devadas, Kurt Keutzer et al. · 1995 · 80 citations
Automatic selection of application-specific instruction-set extensions
Carlo Galuzzi, Elena Moscu Panainte, Yana Yankova et al. · 2006 · 50 citations
1–5 of 20
47
2
h-index
2
h-index
U.S. Army Center for Health Promotion and Preventive Medicine, United States
2 publications · 21 citations
2
h-index
2
h-index
2
h-index
1–5 of 47
25
National University of Singapore
Singapore, Singapore
2 h-index
4 publications
444 citations

UNSW Sydney
Sydney, Australia
2 h-index
6 publications
123 citations
Massachusetts Institute of Technology
Cambridge, United States
2 h-index
4 publications
252 citations
Michigan State University
East Lansing, United States
2 h-index
2 publications
21 citations
University of Illinois Chicago
Chicago, United States
2 h-index
2 publications
21 citations
Carnegie Mellon University
Pittsburgh, United States
2 h-index
3 publications
62 citations
Columbia University
New York, United States
2 h-index
2 publications
21 citations
George Washington University
Washington, United States
1 h-index
1 publications
42 citations
1–8 of 25
2 publications · 67 citations
2
h-index
2 publications · 64 citations
2
h-index
1 publications · 83 citations
1
h-index
1 publications · 17 citations
1
h-index
JID · 1 publications · 10 citations
1
h-index
1–5