805 search results - page 79 / 161 » Combinatorial optimization problems in self-assembly |
ICDM
2008
IEEE
15 years 4 months ago
2008
IEEE
Zero-norm, defined as the number of non-zero elements in a vector, is an ideal quantity for feature selection. However, minimization of zero-norm is generally regarded as a combi...
JCC
2008
14 years 10 months ago
2008
: We adapt a combinatorial optimization algorithm, extremal optimization (EO), for the search problem in computational protein design. This algorithm takes advantage of the knowled...
104
click to vote
CEC
2008
IEEE
15 years 4 months ago
2008
IEEE
—Ant Colony Optimization (ACO) algorithm is a novel meta-heuristic algorithm for the approximate solution of combinatorial optimization problems that has been inspired by the for...
100
Voted
TSMC
2011
14 years 5 months ago
2011
—The university course timetabling problem (UCTP) is a combinatorial optimization problem, in which a set of events has to be scheduled into time slots and located into suitable ...
IAT
2003
IEEE
15 years 3 months ago
2003
IEEE
—Ant-based algorithms or ant colony optimization (ACO) algorithms have been applied successfully to combinatorial optimization problems. More recently, Parpinelli and colleagues ...