805 search results - page 17 / 161 » Combinatorial optimization problems in self-assembly |
WEA
2010
Springer
14 years 4 months ago
2010
Springer
This paper is devoted to a study of the impact of using bound sets in biobjective optimization. This notion, introduced by Villareal and Karwan [19], has been independently revisit...
ERSA
2006
13 years 11 months ago
2006
: A brief review of mapping generalized template matching operations onto reconfigurable computers is given. A combinatorial optimization process, where the objective is to minimiz...
GECCO
2007
Springer
14 years 4 months ago
2007
Springer
We propose a protocol for a local search and a genetic algorithm for the distributed traveling salesman problem (TSP). In the distributed TSP, information regarding the cost funct...
ICML
2007
IEEE
14 years 10 months ago
2007
IEEE
We study the problem of learning kernel machines transductively for structured output variables. Transductive learning can be reduced to combinatorial optimization problems over a...
4OR
2010
13 years 10 months ago
2010
This survey is concerned with the size of perfect formulations for combinatorial optimization problems. By "perfect formulation", we mean a system of linear inequalities...