805 search results - page 9 / 161 » Combinatorial optimization problems in self-assembly |
IDA
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. Since minimum sum-of-squares clustering (MSSC) is an NPhard combinatorial optimization problem, applying techniques from global optimization appears to be promising for r...
GECCO
2011
Springer
13 years 1 months ago
2011
Springer
In continuous optimisation, surrogate models (SMs) are used when tackling real-world problems whose candidate solutions are expensive to evaluate. In previous work, we showed that...
INFOCOM
2012
IEEE
12 years 7 days ago
2012
IEEE
—In this paper, we tackle the spectrum allocation problem in cognitive radio (CR) networks with time-frequency flexibility consideration using combinatorial auction. Different f...
SODA
2010
ACM
14 years 7 months ago
2010
ACM
Finding the largest independent set in a graph is a notoriously difficult NP-complete combinatorial optimization problem. Moreover, even for graphs with largest degree 3, no polyn...
GECCO
2009
Springer
14 years 1 months ago
2009
Springer
When evaluating a heuristic for a combinatorial problem, randomly generated instances of the problem may not provide a thorough exploration of the heuristic's performance, an...