110 search results - page 12 / 22 » New Upper Bounds for Maximum Satisfiability |
FOCS
2006
IEEE
15 years 5 months ago
2006
IEEE
In this work we study a wide range of online and offline routing and packing problems with various objectives. We provide a unified approach, based on a clean primal-dual method...
117
click to vote
DAC
2004
ACM
16 years 22 days ago
2004
ACM
CT An efficient statistical timing analysis algorithm that can handle arbitrary (spatial and structural) causes of delay correlation is described. The algorithm derives the entire ...
CP
2007
Springer
15 years 3 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...
ALT
2009
Springer
15 years 8 months ago
2009
Springer
Motivated by the principle of agnostic learning, we present an extension of the model introduced by Balcan, Blum, and Gupta [3] on computing low-error clusterings. The extended mod...
103
click to vote
GLVLSI
1996
IEEE
15 years 3 months ago
1996
IEEE
In this paper, we propose a global routing algorithm for multi-layer building-block layouts. The algorithm is based on successive ripup and rerouting while satisfying edge capacit...