318 search results - page 34 / 64 » On the equivalence of linear complementarity problems |
141
click to vote
COCOON
2010
Springer
14 years 11 months ago
2010
Springer
The problem of sorting permutations by double-cut-and-joins (SBD) arises when we perform the double-cut-and-join (DCJ) operations on pairs of unichromosomal genomes without the gen...
97
Voted
ICARCV
2008
IEEE
15 years 7 months ago
2008
IEEE
—In this paper, we study the problem of stabilizing a linear time-invariant discrete-time system with information constraints in the input channels. The information constraint in...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by co...
MJ
2007
15 years 14 min ago
2007
Recent algorithmic advances in Boolean satisfiability (SAT), along with highly efficient solver implementations, have enabled the successful deployment of SAT technology in a wi...
CORR
2010
Springer
15 years 18 days ago
2010
Springer
Abstract--In this paper we construct low ML decoding complexity STBCs by using the Pauli matrices as linear dispersion matrices. In this case the Hurwitz-Radon orthogonality condit...