11 search results - page 2 / 3 » On the Hamming distance in combinatorial optimization proble... |
SARA
2009
Springer
13 years 11 months ago
2009
Springer
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each...
STRINGOLOGY
2004
13 years 6 months ago
2004
Recently, there has been a surge of interest in gapped q-gram filters for approximate string matching. Important design parameters for filters are for example the value of q, the f...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
In the design of evolutionary multiobjective optimization (EMO) algorithms, it is important to strike a balance between diversity and convergence. Traditional mask-based crossover...
AUTOMATICA
2008
13 years 4 months ago
2008
Graph matching is a fundamental problem that arises frequently in the areas of distributed control, computer vision, and facility allocation. In this paper, we consider the optimal...
AUSAI
2007
Springer
13 years 11 months ago
2007
Springer
The traditional concept of a genetic algorithm (GA) is that of selection, crossover and mutation. However, a limited amount of data from the literature has suggested that the nich...