Sciweavers

805 search results - page 35 / 161
» Combinatorial optimization problems in self-assembly
Sort
View
IJCAI
2001
14 years 10 days ago
Bundle Design in Robust Combinatorial Auction Protocol against False-name Bids
This paper presents a method for designing bundles in a combinatorial auction protocol that is robust against false-name bids. Internet auctions have become an integral part of El...
Makoto Yokoo, Yuko Sakurai, Shigeo Matsubara
CVPR
2012
IEEE
12 years 4 months ago
Branch-and-price global optimization for multi-view multi-object tracking
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...
Laura Leal-Taixe, Gerard Pons-Moll, Bodo Rosenhahn
GECCO
2010
Springer
156views Optimization» more  GECCO 2010»
14 years 3 months ago
Elementary landscape decomposition of the quadratic assignment problem
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...
J. Francisco Chicano, Gabriel Luque, Enrique Alba
WABI
2005
Springer
109views Bioinformatics» more  WABI 2005»
14 years 4 months ago
Optimal Protein Threading by Cost-Splitting
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...
Philippe Veber, Nicola Yanev, Rumen Andonov, Vince...
INFOCOM
2012
IEEE
12 years 1 months ago
Reverse-engineering BitTorrent: A Markov approximation perspective
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...
Ziyu Shao, Hao Zhang, Minghua Chen, Kannan Ramchan...