Sciweavers

805 search results - page 1 / 161
» Combinatorial optimization problems in self-assembly
Sort
View
CEC
2011
IEEE
12 years 5 months ago
Oppositional biogeography-based optimization for combinatorial problems
Abstract—In this paper, we propose a framework for employing opposition-based learning to assist evolutionary algorithms in solving discrete and combinatorial optimization proble...
Mehmet Ergezer, Dan Simon
CORR
2004
Springer
104views Education» more  CORR 2004»
13 years 5 months ago
Inapproximability of Combinatorial Optimization Problems
We survey results on the hardness of approximating combinatorial optimization problems. Contents
Luca Trevisan
CPAIOR
2011
Springer
12 years 9 months ago
Manipulating MDD Relaxations for Combinatorial Optimization
Abstract. We study the application of limited-width MDDs (multivalued decision diagrams) as discrete relaxations for combinatorial optimization problems. These relaxations are used...
David Bergman, Willem Jan van Hoeve, John N. Hooke...
EMNLP
2011
12 years 5 months ago
Simple Effective Decipherment via Combinatorial Optimization
We present a simple objective function that when optimized yields accurate solutions to both decipherment and cognate pair identification problems. The objective simultaneously s...
Taylor Berg-Kirkpatrick, Dan Klein
IBIS
2006
109views more  IBIS 2006»
13 years 5 months ago
Formulation Schema Matching Problem for Combinatorial Optimization Problem
: 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 ...
Zhi Zhang, Pengfei Shi, Haoyang Che, Yong Sun, Jun...