An Optimal Lower-Bound Algorithm for the High-Level Synthesis Scheduling Problem.

Geguang Pu Jifeng He Zongyan Qiu

Published in: DDECS (2006)

Keyphrases

optimal solution
np hard
worst case
lower bound
dynamic programming
objective function
scheduling problem
competitive ratio
learning algorithm
pattern recognition
computational complexity
simulated annealing
computer vision
bayesian networks
branch and bound
optimal scheduling