537 search results - page 25 / 108 » A new upper bound for 3-SAT |
EVOW
2007
Springer
14 years 2 months ago
2007
Springer
We present a Lagrangian decomposition approach for the Knapsack Constrained Maximum Spanning Tree problem yielding upper bounds as well as heuristic solutions. This method is furth...
CP
2005
Springer
14 years 2 months ago
2005
Springer
Besides search, complete inference methods can also be used to solve soft constraint problems. Their main drawback is the high spatial complexity. To improve its practical usage, w...
ML
2000
ACM
13 years 8 months ago
2000
ACM
Capacity control in perceptron decision trees is typically performed by controlling their size. We prove that other quantities can be as relevant to reduce their flexibility and co...
CORR
2008
Springer
13 years 8 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...
TIT
2010
13 years 3 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 ...