Old Web
English
Sign In
Acemap
>
Paper
>
A New Rewarding Mechanism for Branching Heuristic in SAT Solvers
A New Rewarding Mechanism for Branching Heuristic in SAT Solvers
2019
Wenjing Chang
Yang Xu
Shuwei Chen
Keywords:
Theoretical computer science
Mathematical optimization
Conflict-Driven Clause Learning
Branching (version control)
Heuristic
Mathematics
Boolean satisfiability problem
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]