A comparison of graph coloring heuristics for register allocation based on coalescing in interval graphs.
Thomas ZeitlhoferBernhard WessPublished in: ISCAS (4) (2004)
Keyphrases
- graph coloring
- hyper heuristics
- hamiltonian cycle
- distributed sensor networks
- combinatorial problems
- job shop scheduling
- constraint satisfaction problems
- np complete problems
- genetic programming
- phase transition
- timetabling problem
- evolutionary algorithm
- difficult problems
- max sat
- neural network
- constraint propagation
- search algorithm
- scheduling problem
- artificial bee colony
- bin packing
- artificial neural networks
- metaheuristic
- objective function