77 search results - page 5 / 16 » The Core Concept for 0 1 Integer Programming |
DATE
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract: This paper addresses the problem of equivalence verification of RTL descriptions that implement arithmetic computations (add, mult, shift) over bitvectors that have di...
GLOBECOM
2008
IEEE
14 years 2 months ago
2008
IEEE
—In this paper, we manage to prove the log-concavity of the generalized Marcum Q-function Qν (a, b) with respect to its order ν on [1, ∞). The proof relies on a powerful math...
CPAIOR
2007
Springer
14 years 2 months ago
2007
Springer
A linear pseudo-Boolean constraint (LPB) is an expression of the form a1 · 1 + . . . + am · m ≥ d, where each i is a literal (it assumes the value 1 or 0 depending on whether a...
AISC
2010
Springer
14 years 18 days ago
2010
Springer
Abstract. The main goal of our work is to formally prove the correctness of the key commands of the SCHUR software, an interactive program for calculating with characters of Lie gr...
LPNMR
2004
Springer
14 years 1 months ago
2004
Springer
We investigate mca-programs, that is, logic programs with clauses built of monotone cardinality atoms of the form kX , where k is a non-negative integer and X is a finite set of ...