A branch-and-bound method for optimal transformation of data flow graphs for observing hardware constraints.
Werner GrassPublished in: EURO-DAC (1990)
Keyphrases
- branch and bound method
- optimal configuration
- real time
- optimal solution
- branch and bound
- branch and bound algorithm
- reduce the search space
- lower bound
- computationally expensive
- upper bound
- feasible solution
- hardware implementation
- mixed integer
- mixed integer programming
- simulated annealing
- linear programming
- constraint satisfaction
- constraint programming
- dynamic programming