543 search results - page 25 / 109 » New Upper Bounds for MaxSat |
SOFSEM
2007
Springer
15 years 3 months ago
2007
Springer
Prior algorithms known for exactly solving Max 2-Sat improve upon the trivial upper bound only for very sparse instances. We present new algorithms for exactly solving (in fact, c...
91
Voted
CORR
2008
Springer
14 years 9 months ago
2008
Springer
New upper and lower bounds are presented on the capacity of the free-space optical intensity channel. This channel is characterized by inputs that are nonnegative (representing the...
58
Voted
TIT
2010
14 years 4 months ago
2010
The theory of Markov set-chains is applied to derive upper and lower bounds on the capacity of finite-state channels that are tighter than the classic bounds by Gallager. The new ...
DATE
1998
IEEE
15 years 1 months ago
1998
IEEE
We propose a new approach to RT-level power modeling for combinationalmacros, that does not require simulationbased characterization. A pattern-dependent power model for a macro i...
EOR
2008
14 years 9 months ago
2008
The 0-1 Multidimensional Knapsack Problem (0-1 MKP) is a wellknown (and strongly NP-hard) combinatorial optimization problem with many applications. Up to now, the majority of upp...