— We consider dual subgradient methods for solving (nonsmooth) convex constrained optimization problems. Our focus is on generating approximate primal solutions with performance ...
Abstract— In recent years performance prediction for communication systems utilizing iteratively decodable codes has been of considerable interest. There have been significant b...
Compositional performance analysis iteratively alternates local scheduling analysis techniques and output event model propagation between system components to enable performance a...
Abstract. By introducing a parallel extension rule that is aware of independence of the introduced extension variables, a calculus for quantified propositional logic is obtained w...
We present a formulation of retiming to minimize the number of registers in a design by iterating a maximum network flow problem. The retiming returned will be the optimum one whi...
Aaron P. Hurst, Alan Mishchenko, Robert K. Brayton