817 search results - page 32 / 164 » Exact solutions to linear programming problems |
MP
2011
13 years 3 months ago
2011
We consider a quadratic programming (QP) problem (Π) of the form min xT Cx subject to Ax ≥ b where C ∈ Rn×n + , rank(C) = 1 and A ∈ Rm×n , b ∈ Rm . We present an FPTAS ...
DAC
2007
ACM
14 years 9 months ago
2007
ACM
The flip-chip package provides a high chip-density solution to the demand for more I/O pads of VLSI designs. In this paper, we present the first routing algorithm in the literatur...
MIC
2003
13 years 10 months ago
2003
E.I.Verriest and F.L.Lewis have presented in [1] a new method to approach the minimum-time control of linear continous-time systems avoiding the Bang-Bang control. Their method re...
JMLR
2006
13 years 8 months ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
PAMI
2006
13 years 8 months ago
2006
A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. ...