840 search results - page 41 / 168 » Inapproximability of Combinatorial Optimization Problems |
CVPR
2012
IEEE
12 years 4 months ago
2012
IEEE
We present a new algorithm to jointly track multiple objects in multi-view images. While this has been typically addressed separately in the past, we tackle the problem as a single...
GECCO
2010
Springer
14 years 3 months ago
2010
Springer
The Quadratic Assignment Problem (QAP) is a well-known NP-hard combinatorial optimization problem that is at the core of many real-world optimization problems. We prove that QAP c...
WABI
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. In this paper, we use integer programming approach for solving a hard combinatorial optimization problem, namely protein threading. For this sequence-to-structure alignme...
INFOCOM
2012
IEEE
12 years 1 months ago
2012
IEEE
Abstract—BitTorrent has been the most popular P2P (Peer-toPeer) paradigm during recent years. Built upon great intuition, the piece-selection and neighbor-selection modules roote...
CP
2009
Springer
14 years 5 months ago
2009
Springer
The problem of finding a collection of solutions to a combinatorial problem that is optimal in terms of an inter-solution objective function exists in many application settings. F...