Sciweavers

26 search results - page 2 / 6
» Bicriteria Network Design via Iterative Rounding
Sort
View
FSTTCS
2009
Springer
13 years 11 months ago
Iterative Methods in Combinatorial Optimization
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
R. Ravi
TIT
2010
141views Education» more  TIT 2010»
12 years 11 months ago
Distributed averaging via lifted Markov chains
Abstract--Motivated by applications of distributed linear estimation, distributed control, and distributed optimization, we consider the question of designing linear iterative algo...
Kyomin Jung, Devavrat Shah, Jinwoo Shin
ISPD
2006
ACM
103views Hardware» more  ISPD 2006»
13 years 10 months ago
High accurate pattern based precondition method for extremely large power/ground grid analysis
In this paper, we propose more accurate power/ground network circuit model, which consider both via and ground bounce effects to improve the performance estimation accuracy of on-...
Jin Shi, Yici Cai, Sheldon X.-D. Tan, Xianlong Hon...
FMCAD
2007
Springer
13 years 11 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
CASES
2010
ACM
13 years 2 months ago
Low cost multicast authentication via validity voting in time-triggered embedded control networks
Wired embedded networks must include multicast authentication to prevent masquerade attacks within the network. However, unique constraints for these networks make most existing m...
Christopher Szilagyi, Philip Koopman