805 search results - page 103 / 161 » Combinatorial optimization problems in self-assembly |
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
The Cross Entropy algorithm is a new search method for combinatorial problem. However, it needs considerable computational time to achieve good solution quality. To make the Cross...
110
Voted
AIR
2004
15 years 12 days ago
2004
Ensuring truthfulness amongst self-interested agents bidding against one another in an auction can be computationally expensive when prices are determined using the Vickrey-Clarke-...
100
click to vote
SDM
2010
SIAM
14 years 11 months ago
2010
SIAM
A popular approach for dimensionality reduction and data analysis is principal component analysis (PCA). A limiting factor with PCA is that it does not inform us on which of the o...
81
Voted
IWANN
2001
Springer
15 years 5 months ago
2001
Springer
This paper looks upon the standard genetic algorithm as an artificial self-organizing process. With the purpose to provide concepts that make the algorithm more open for scalabili...
SCALESPACE
2009
Springer
15 years 7 months ago
2009
Springer
Multi-class labeling is one of the core problems in image analysis. We show how this combinatorial problem can be approximately solved using tools from convex optimization. We sugg...