Sciweavers

27 search results - page 6 / 6
» The Complexity of Generic Primal Algorithms for Solving Gene...
Sort
View
CPAIOR
2008
Springer
13 years 7 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann
GECCO
2010
Springer
211views Optimization» more  GECCO 2010»
13 years 6 months ago
Investigating EA solutions for approximate KKT conditions in smooth problems
Evolutionary algorithms (EAs) are increasingly being applied to solve real-parameter optimization problems due to their flexibility in handling complexities such as non-convexity,...
Rupesh Tulshyan, Ramnik Arora, Kalyanmoy Deb, Joyd...