805 search results - page 1 / 161 » Combinatorial optimization problems in self-assembly |
108
click to vote
CEC
2011
IEEE
13 years 10 months ago
2011
IEEE
Abstract—In this paper, we propose a framework for employing opposition-based learning to assist evolutionary algorithms in solving discrete and combinatorial optimization proble...
CORR
2004
Springer
14 years 10 months ago
2004
Springer
We survey results on the hardness of approximating combinatorial optimization problems. Contents
105
click to vote
CPAIOR
2011
Springer
14 years 2 months ago
2011
Springer
Abstract. We study the application of limited-width MDDs (multivalued decision diagrams) as discrete relaxations for combinatorial optimization problems. These relaxations are used...
EMNLP
2011
13 years 10 months ago
2011
We present a simple objective function that when optimized yields accurate solutions to both decipherment and cognate pair identification problems. The objective simultaneously s...
IBIS
2006
14 years 10 months ago
2006
: Schema matching is the task of finding semantic correspondences between elements of two schemas, which plays a key role in many database applications. In this paper, we cast the ...