Register Allocation Based on Boolean Satisfiability.
Mengmeng YangJie LiuPublished in: ECC (2) (2014)
Keyphrases
- boolean satisfiability
- sat solvers
- probabilistic planning
- branch and bound algorithm
- sat solving
- randomly generated
- integer linear programming
- boolean optimization
- maximum satisfiability
- sat problem
- symmetry breaking
- search space
- lower bound
- max sat
- combinatorial problems
- orders of magnitude
- upper bound
- search tree
- phase transition
- np complete