Login / Signup

A New Approach to Finding Optimal Linear Schedules for Uniform Dependence Algorithms.

Jong-Chuang TsayJenn-Yang Ke
Published in: Parallel Algorithms Appl. (1995)
Keyphrases
  • finding optimal
  • computational cost
  • orders of magnitude
  • combinatorial optimization
  • upper bound
  • optimization problems
  • computationally efficient
  • data structure
  • branch and bound algorithm