Value Ordering Heuristics
Value Ordering Heuristic is a decision strategy in constraint satisfaction that selects the next value to assign to a variable by prioritizing values most likely to lead to a solution, thereby reducing search effort through informed value selection.
16
Publications
840
Citations
32
Authors
17
Institutions
Publications per year
2017–2026
2
Parents
16
Automatic algorithm configuration based on local search
Frank Hutter, Holger H. Hoos, Thomas Stützle · 2007 · 235 citations
Look-ahead value ordering for constraint satisfaction problems
Daniel Frost, Rina Dechter · 1995 · 103 citations
1–5 of 16
32
3
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 32
17

University College Cork
Cork, Ireland
2 h-index
5 publications
66 citations

University of Regina
Regina, Canada
2 h-index
4 publications
106 citations

University of Toronto
Toronto, Canada
2 h-index
3 publications
210 citations
Loughborough University
Loughborough, United Kingdom
1 h-index
2 publications
96 citations
Computer Algorithms for Medicine
Graz, Austria
1 h-index
1 publications
12 citations

University of Huddersfield
Huddersfield, United Kingdom
1 h-index
1 publications
27 citations

Centre National de la Recherche Scientifique
Paris, France
1 h-index
1 publications
18 citations
Arizona State University
Tempe, United States
1 h-index
2 publications
52 citations
1–8 of 17
1 publications · 13 citations
1
h-index
Repository · 1 publications · 50 citations
1
h-index
1 publications · 170 citations
1
h-index
Repository · 1 publications · 12 citations
1
h-index
1 publications · 48 citations
1
h-index
1–5