Sciweavers

2180 search results - page 181 / 436
» Comparing bio-inspired algorithms in constrained optimizatio...
Sort
View
SODA
2001
ACM
166views Algorithms» more  SODA 2001»
15 years 4 months ago
Better approximation algorithms for bin covering
Bin covering takes as input a list of items with sizes in (0 1) and places them into bins of unit demand so as to maximize the number of bins whose demand is satis ed. This is in ...
János Csirik, David S. Johnson, Claire Keny...
95
Voted
GECCO
2007
Springer
124views Optimization» more  GECCO 2007»
15 years 7 months ago
Fitness-proportional negative slope coefficient as a hardness measure for genetic algorithms
The Negative Slope Coefficient (nsc) is an empirical measure of problem hardness based on the analysis of offspring-fitness vs. parent-fitness scatterplots. The nsc has been teste...
Riccardo Poli, Leonardo Vanneschi
CEC
2009
IEEE
15 years 8 months ago
Automatic clustering with multi-objective Differential Evolution algorithms
—This paper applies the Differential Evolution (DE) algorithm to the task of automatic fuzzy clustering in a Multi-objective Optimization (MO) framework. It compares the performa...
Kaushik Suresh, Debarati Kundu, Sayan Ghosh, Swaga...
CRYPTO
2009
Springer
82views Cryptology» more  CRYPTO 2009»
15 years 10 months ago
Solving Hidden Number Problem with One Bit Oracle and Advice
In the Hidden Number Problem (HNP), the goal is to find a hidden number s, when given p, g and access to an oracle that on query a returns the k most significant bits of s · ga ...
Adi Akavia
105
Voted
GECCO
2006
Springer
265views Optimization» more  GECCO 2006»
15 years 7 months ago
Cutting stock waste reduction using genetic algorithms
A new model for the One-dimensional Cutting Stock problem using Genetic Algorithms (GA) is developed to optimize construction steel bars waste. One-dimensional construction stocks...
Yaser M. A. Khalifa, O. Salem, A. Shahin