805 search results - page 34 / 161 » Combinatorial optimization problems in self-assembly |
108
Voted
AAAI
2004
15 years 1 months ago
2004
Recent algorithms provide powerful solutions to the problem of determining cost-minimizing (or revenue-maximizing) allocations of items in combinatorial auctions. However, in many...
117
Voted
CEC
2009
IEEE
14 years 10 months ago
2009
IEEE
-- Most optimization algorithms that use probabilistic models focus on extracting the information from good solutions found in the population. A selection method discards the below...
ORL
2006
15 years 9 days ago
2006
This article introduces a proper redefinition of the concept of bottleneck Steiner distance for the Prize-Collecting Steiner Problem. This allows the application of reduction test...
ICPR
2000
IEEE
16 years 1 months ago
2000
IEEE
Motion segmentation using feature correspondences can be regarded as a combinatorial problem. A motion segmentation algorithm using feature selection and subspace method is propos...
84
Voted
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
The landscape formalism unites a finite candidate solution set to a neighborhood topology and an objective function. This construct can be used to model the behavior of local sea...