805 search results - page 45 / 161 » Combinatorial optimization problems in self-assembly |
132
Voted
COCOON
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...
125
Voted
EOR
2008
15 years 2 months ago
2008
The 0-1 Multidimensional Knapsack Problem (0-1 MKP) is a wellknown (and strongly NP-hard) combinatorial optimization problem with many applications. Up to now, the majority of upp...
125
click to vote
ICCV
2005
IEEE
16 years 4 months ago
2005
IEEE
A new framework is presented that uses tools from duality theory of linear programming to derive graph-cut based combinatorial algorithms for approximating NP-hard classification ...
100
Voted
DAM
2006
15 years 2 months ago
2006
Let P be a combinatorial optimization problem, and let A be an approximation algorithm for P. The domination ratio domr(A, s) is the maximal real q such that the solution x(I) obt...
141
Voted
ICCV
2011
IEEE
14 years 2 months ago
2011
IEEE
Fitting statistical 2D and 3D shape models to images is necessary for a variety of tasks, such as video editing and face recognition. Much progress has been made on local fitting...