130 search results - page 2 / 26 » A New Upper Bound for Max-2-Sat: A Graph-Theoretic Approach |
CORR
2008
Springer
13 years 4 months ago
2008
Springer
We present a graph theoretic upper bound on speedup needed to achieve 100% throughput in a multicast switch using network coding. By bounding speedup, we show the equivalence betwe...
BMCBI
2006
13 years 4 months ago
2006
Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this p...
CP
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. Finding feasible points for which the proof succeeds is a critical issue in safe Branch and Bound algorithms which handle continuous problems. In this paper, we introduce...
MOBIHOC
2007
ACM
14 years 4 months ago
2007
ACM
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We give a new insight into the upper bounding of the 3-SAT threshold by the first moment method. The best criteria developed so far to select the solutions to be counted discrimina...