149 search results - page 26 / 30 » Solving large scale combinatorial optimization using PMA-SLS |
SODA
2004
ACM
15 years 1 months ago
2004
ACM
We study the average-case performance of algorithms for the binary knapsack problem. Our focus lies on the analysis of so-called core algorithms, the predominant algorithmic conce...
110
click to vote
ACIIDS
2012
IEEE
13 years 7 months ago
2012
IEEE
This paper proposes a new approach by combining the Evolutionary Algorithm and Imperialist Competitive Algorithm. This approach tries to capture several people involved in communit...
126
click to vote
SAC
2006
ACM
14 years 11 months ago
2006
ACM
Interactive configuration guides a user searching through a large combinatorial space of solutions to a system of constraints. We investigate a class of very expressive underlying...
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
This paper extends previous work showing how fluctuating crosstalk in a deterministic fitness function introduces noise into genetic algorithms. In that work, we modeled fluctuati...
123
click to vote
SDM
2008
SIAM
15 years 1 months ago
2008
SIAM
Maximum margin clustering (MMC) is a recently proposed clustering method, which extends the theory of support vector machine to the unsupervised scenario and aims at finding the m...