2084 search results - page 169 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
167
click to vote
IPPS
2005
IEEE
15 years 10 months ago
2005
IEEE
— Program code size is a critical factor in determining the manufacturing cost of many embedded systems, particularly those aimed at the extremely costconscious consumer market. ...
135
click to vote
DAC
2005
ACM
15 years 7 months ago
2005
ACM
In this paper, we propose a new sensitivity based, statistical gate sizing method. Since circuit optimization effects the entire shape of the circuit delay distribution, it is dif...
228
click to vote
GIS
2006
ACM
16 years 6 months ago
2006
ACM
We give two efficient on-line algorithms to simplify weighted graphs by eliminating degree-two vertices. Our algorithms are on-line -- they react to updates on the data, keeping t...
167
Voted
APPROX
2008
Springer
15 years 7 months ago
2008
Springer
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
150
Voted
DISOPT
2007
15 years 5 months ago
2007
The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...