Graph-coloring and treescan register allocation using repairing.
Quentin ColombetBenoit BoissinotPhilip BriskSebastian HackFabrice RastelloPublished in: CASES (2011)
Keyphrases
- graph coloring
- combinatorial problems
- job shop scheduling
- np complete problems
- phase transition
- constraint satisfaction problems
- scheduling problem
- max sat
- hyper heuristics
- constraint programming
- combinatorial optimization
- bin packing
- genetic programming
- tabu search
- traveling salesman problem
- job shop scheduling problem