Sciweavers

6456 search results - page 1030 / 1292
» Constraint Solving on Terms
Sort
View
GECCO
2009
Springer
133views Optimization» more  GECCO 2009»
15 years 11 months ago
Evolutionary codings and operators for the terminal assignment problem
Given a collection of terminals, each with a demand, a collection of concentrators, each with a capacity, and costs of connecting the terminals to the concentrators, the terminal ...
Bryant A. Julstrom
GECCO
2009
Springer
153views Optimization» more  GECCO 2009»
15 years 11 months ago
An evaporation mechanism for dynamic and noisy multimodal optimization
Dealing with imprecise information is a common characteristic in real-world problems. Specifically, when the source of the information are physical sensors, a level of noise in t...
Jose Luis Fernandez-Marquez, Josep Lluís Ar...
GECCO
2009
Springer
152views Optimization» more  GECCO 2009»
15 years 11 months ago
A data-based coding of candidate strings in the closest string problem
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...
Bryant A. Julstrom
GECCO
2009
Springer
126views Optimization» more  GECCO 2009»
15 years 11 months ago
Improving NSGA-II with an adaptive mutation operator
The performance of a Multiobjective Evolutionary Algorithm (MOEA) is crucially dependent on the parameter setting of the operators. The most desired control of such parameters pre...
Arthur Gonçalves Carvalho, Aluizio F. R. Ar...
AUSSOIS
2001
Springer
15 years 11 months ago
An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming
In recent years the branch-and-cut method, a synthesis of the classical branch-and-bound and cutting plane methods, has proven to be a highly successful approach to solving large-s...
Adam N. Letchford, Andrea Lodi
« Prev « First page 1030 / 1292 Last » Next »