Variable Ordering Heuristics
Variable Ordering Heuristics is a strategy in constraint satisfaction problems that determines the sequence in which variables are assigned values during search, prioritizing variables based on criteria such as minimum remaining values or degree to enhance the efficiency of solution discovery.
113
Publications
7K
Citations
231
Authors
113
Institutions
Publications per year
2017–2026
7
Parents
113
Logic verification using binary decision diagrams in a logic synthesis environment
Sharad Malik, A.R. Wang, Robert K. Brayton et al. · 2003 · 509 citations
Implicit state enumeration of finite state machines using BDD's
H.J. Touati, H. Savoj, Binshan Lin et al. · 2002 · 403 citations
Boosting systematic search by weighting constraints
Frédéric Boussemart, Fred Hémery, Christophe Lecoutre et al. · 2004 · 399 citations
1–5 of 113
231
6
h-index
6
h-index
5
h-index
5
h-index
5
h-index
1–5 of 231
113
University of Colorado Boulder
Boulder, United States
5 h-index
14 publications
942 citations

University of Regina
Regina, Canada
5 h-index
10 publications
230 citations
University of Michigan
Ann Arbor, United States
5 h-index
14 publications
559 citations
University of California, Irvine
Irvine, United States
4 h-index
10 publications
486 citations

Centre National de la Recherche Scientifique
Paris, France
3 h-index
8 publications
1.8K citations

University of Freiburg
Freiburg im Breisgau, Germany
3 h-index
4 publications
50 citations

University College Cork
Cork, Ireland
3 h-index
9 publications
114 citations
University of California, Berkeley
Berkeley, United States
3 h-index
11 publications
4.1K citations
1–8 of 113
JAIR · 4 publications · 164 citations
4
h-index
Conference · 3 publications · 282 citations
3
h-index
Conference · 3 publications · 81 citations
3
h-index
2 publications · 74 citations
2
h-index
2 publications · 30 citations
2
h-index
1–5