Login / Signup
Efficient register and memory assignment for non-orthogonal architectures via graph coloring and MST algorithms.
Jeonghun Cho
Yunheung Paek
David B. Whalley
Published in:
LCTES-SCOPES (2002)
Keyphrases
</>
graph coloring
learning algorithm
combinatorial problems
neural network
computational complexity
job shop scheduling
search space
special case
space complexity