543 search results - page 33 / 109 » New Upper Bounds for MaxSat |
WABI
2009
Springer
15 years 4 months ago
2009
Springer
We present a novel dynamic programming framework that allows one to compute tight upper bounds for the p-values of gapped local alignments in pseudo–polynomial time. Our algorith...
58
Voted
FSTTCS
2008
Springer
14 years 10 months ago
2008
Springer
We consider the problem of maintaining information about the rank of a matrix M under changes to its entries. For an n × n matrix M, we show an amortized upper bound of O(nω−1)...
JCT
2007
14 years 9 months ago
2007
We give a new upper bound for the rectilinear crossing number cr(n) of the complete geometric graph Kn. We prove that cr(n) ≤ 0.380559 ¡n 4 ¢ + Θ(n3 ) by means of a new const...
AIPS
2004
14 years 11 months ago
2004
Cumulative scheduling is a generalization of jobshop scheduling, where machines have discrete capacities and activities may require several capacity units. This paper considers it...
DATE
2003
IEEE
15 years 3 months ago
2003
IEEE
The growing impact of within-die process variation has created the need for statistical timing analysis, where gate delays are modeled as random variables. Statistical timing anal...