1132 search results - page 76 / 227 » Upper and lower Ramsey bounds in bounded arithmetic |
175
click to vote
SLS
2009
Springer
16 years 27 days ago
2009
Springer
Stochastic local search algorithms can now successfully solve MAXSAT problems with thousands of variables or more. A key to this success is how effectively the search can navigate...
147
click to vote
ATAL
2007
Springer
16 years 17 days ago
2007
Springer
This paper contributes to solve effectively stochastic resource allocation problems known to be NP-Complete. To address this complex resource management problem, a Qdecomposition...
168
click to vote
DAC
1995
ACM
15 years 10 months ago
1995
ACM
The Elmore delay is an extremely popular delay metric, particularly for RC tree analysis. The widespread usage of this metric is mainly attributable to it being the most accurate ...
148
click to vote
TIT
2011
15 years 1 months ago
2011
— This paper presents new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to various nonlinear codeword length...
123
click to vote
WAOA
2007
Springer
16 years 14 days ago
2007
Springer
In the incremental version of the well-known k-median problem the objective is to compute an incremental sequence of facility sets F1 ⊆ F2 ⊆ .... ⊆ Fn, where each Fk contain...