805 search results - page 98 / 161 » Combinatorial optimization problems in self-assembly |
ICCV
2007
IEEE
16 years 12 hour ago
2007
IEEE
In this paper we propose a general framework to solve the articulated shape matching problem, formulated as finding point-to-point correspondences between two shapes represented b...
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
The deterministic Multi-step Crossover Fusion (dMSXF) is an improved crossover method of MSXF which is a promising method of JSP, and it shows high availability in TSP. Both of th...
AI
1999
Springer
14 years 9 months ago
1999
Springer
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
COCOA
2009
Springer
15 years 4 months ago
2009
Springer
In the context of scheduling and timetabling, we study a challenging combinatorial problem which is very interesting for both practical and theoretical points of view. The motivati...
IVC
2007
14 years 10 months ago
2007
We introduce a convex relaxation approach for the quadratic assignment problem to the field of computer vision. Due to convexity, a favourable property of this approach is the ab...