177 search results - page 4 / 36 » Semidefinite Programming Relaxations for the Quadratic Assig... |
FCT
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. In recent years we have witnessed the proliferation of semidefinite programming bounds in combinatorial optimization [1,5,8], quantum computing [9,2,3,6,4,16] and even in...
COR
2006
13 years 7 months ago
2006
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
CDC
2008
IEEE
13 years 9 months ago
2008
IEEE
In this paper, an input/output system identification technique for the Wiener-Hammerstein model and its feedback extension is proposed. In the proposed framework, the identificatio...
CVPR
2006
IEEE
14 years 9 months ago
2006
IEEE
This paper presents a generic method for solving Markov random fields (MRF) by formulating the problem of MAP estimation as 0-1 quadratic programming (QP). Though in general solvi...