486 search results - page 55 / 98 » Improved upper bounds for 3-SAT |
SPAA
1996
ACM
15 years 1 months ago
1996
ACM
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...
ICCAD
2003
IEEE
15 years 3 months ago
2003
IEEE
Process variations have become a critical issue in performance verification of high-performance designs. We present a new, statistical timing analysis method that accounts for int...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
We settle the 1-pass space complexity of (1 ? )approximating the Lp norm, for real p with 1 p 2, of a length-n vector updated in a length-m stream with updates to its coordinate...
FSTTCS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. This paper proposes a new algorithm that improves the complexity bound for solving parity games. Our approach combines McNaughton’s iterated fixed point algorithm with...
CP
2007
Springer
15 years 1 months ago
2007
Springer
Recent research has focused on using the power of look-ahead to speed up the resolution of the Max-SAT problem. Indeed, look-ahead techniques such as Unit Propagation (UP) allow to...