Now showing items 1-3 of 3

    • A Mixed Integer Linear Programming Problem Which is Efficiently Solvable 

      Leiserson, Charles E.; Saxe, James B. (1985-07)
      Efficient algorithms are known for the simple linear programming problem where each inequality is of the form xj-xi<=aij. Furthermore, these techniques extend to the integer linear programming variant of the problem. This ...
    • Optimizing Synchronous Systems 

      Leiserson, Charles E.; Saxe, James B. (1982-03)
      The complexity of integrated-circuit chips produced today makes it feasible to build inexpensive, special-purpose subsystems that rapidly solve sophisticated problems on behalf of a general-purpose host computer. This paper ...
    • Retiming Synchronous Circuitry 

      Leiserson, Charles E.; Saxe, James B. (1986-05)
      This paper shows how the technique of retiming can be used to transform a given sycnhronous circuit into a more efficient circuit under a variety of different cost criteria. We model a circuit as a graph, and we give an ...