4354 search results - page 517 / 871 » Classification-based objective functions |
164
click to vote
FCT
2003
Springer
15 years 12 months ago
2003
Springer
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...
151
click to vote
GECCO
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. Although evolutionary algorithms (EAs) are often successfully used for the optimization of dynamically changing objective function, there are only very few theoretical re...
160
click to vote
GECCO
2003
Springer
15 years 12 months ago
2003
Springer
In a two-market genetic algorithm applied to a constrained optimization problem, two ‘markets’ are maintained. One market establishes fitness in terms of the objective functio...
194
click to vote
GECCO
2003
Springer
15 years 12 months ago
2003
Springer
In this paper we present an approach that evolves the consensus sequence [25] for multiple sequence alignment (MSA) with genetic algorithm (GA). We have developed an encoding schem...
203
click to vote
GECCO
2003
Springer
15 years 12 months ago
2003
Springer
This paper discusses a new model of parallel evolutionary algorithms (EAs) called the specialized island model (SIM) that can be used to generate a set of diverse non-dominated sol...