Sciweavers

485 search results - page 56 / 97
» Iterative Bounding LAO
Sort
View
87
Voted
CISS
2008
IEEE
15 years 4 months ago
Subgradient methods in network resource allocation: Rate analysis
— We consider dual subgradient methods for solving (nonsmooth) convex constrained optimization problems. Our focus is on generating approximate primal solutions with performance ...
Angelia Nedic, Asuman E. Ozdaglar
ICC
2007
IEEE
107views Communications» more  ICC 2007»
15 years 4 months ago
Error Floors of LDPC Coded BICM
Abstract— In recent years performance prediction for communication systems utilizing iteratively decodable codes has been of considerable interest. There have been significant b...
Aditya Ramamoorthy, Nedeljko Varnica
IPPS
2007
IEEE
15 years 4 months ago
Improved Output Jitter Calculation for Compositional Performance Analysis of Distributed Systems
Compositional performance analysis iteratively alternates local scheduling analysis techniques and output event model propagation between system components to enable performance a...
Rafik Henia, Razvan Racu, Rolf Ernst
CSL
2007
Springer
15 years 4 months ago
Propositional Logic for Circuit Classes
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...
Klaus Aehlig, Arnold Beckmann
91
Voted
FMCAD
2007
Springer
15 years 4 months ago
Fast Minimum-Register Retiming via Binary Maximum-Flow
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