543 search results - page 24 / 109 » New Upper Bounds for MaxSat |
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
— We propose the novel concept of cooperation for deafness prevention in directional antenna ad hoc networks, along with a low-complexity multiuser detector specialised for these...
TIT
2010
14 years 4 months ago
2010
Upper and lower bounds are obtained for the joint entropy of a collection of random variables in terms of an arbitrary collection of subset joint entropies. These inequalities gene...
EVOW
2007
Springer
15 years 3 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
15 years 3 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
14 years 9 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...