13376 search results - page 326 / 2676 » Problem Solving with |
135
click to vote
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
Given a set of strings S of equal lengths over an alphabet Σ, the closest string problem seeks a string over Σ whose maximum Hamming distance to any of the given strings is as s...
126
click to vote
CEC
2007
IEEE
15 years 10 months ago
2007
IEEE
— We present an ant model that solves a discrete foraging problem. We describe simulations and provide a complete convergence analysis: we show that the ant population computes t...
140
click to vote
GECCO
2010
Springer
15 years 9 months ago
2010
Springer
This paper proposes an estimation of distribution algorithm (EDA) aiming at addressing globally multimodal problems, i.e., problems that present several global optima. It can be r...
113
click to vote
SAC
2005
ACM
15 years 9 months ago
2005
ACM
This paper addresses single and multiple container loading problems. We propose to use dynamic prioritization to handle awkward box types. The box type with a higher priority will...
128
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
Recent studies on the support of engineers during conceptual design resulted in a non-traditional type of Multi-Objective Problems (MOPs), namely concept-based ones. In concept-ba...