GECCO
2004
Springer
13 years 10 months ago
2004
Springer
Application-specific, parameterized local search algorithms (PLSAs), in which optimization accuracy can be traded off with runtime, arise naturally in many optimization contexts....
GECCO
2004
Springer
13 years 10 months ago
2004
Springer
This paper describes a continuous estimation of distribution algorithm (EDA) to solve decomposable, real-valued optimization problems quickly, accurately, and reliably. This is the...
GECCO
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. When direct measurement of model parameters is not possible, these need to be inferred indirectly from calibration data. To solve this inverse problem, an algorithm that ...
GECCO
2004
Springer
13 years 10 months ago
2004
Springer
Genetic programming may be seen as a recent incarnation of a long-held goal in evolutionary computation: to develop actual computational devices through evolutionary search. Geneti...
GECCO
2004
Springer
13 years 10 months ago
2004
Springer
This paper proposes an experimental evaluation of various discretization schemes in three different evolutionary systems for inductive concept learning. The various discretization...
GECCO
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. This work compares different metaheuristics techniques applied to an important problem in natural language: tagging. Tagging amounts to assigning to each word in a text ...
GECCO
2004
Springer
13 years 10 months ago
2004
Springer
The availability of new information can often necessitate rerouting of a vehicle. In [1], the set of nonoverlapping useful vicinities of the reconnaissance sites, S, and the 3D spa...
GECCO
2004
Springer
13 years 10 months ago
2004
Springer
Traditionally, the mutation rates of genetic algorithms are fixed or decrease over the generations. Although it seems to be reasonable for classical genetic algorithms, it may not...
GECCO
2004
Springer
13 years 10 months ago
2004
Springer
GECCO
2004
Springer
13 years 10 months ago
2004
Springer
The simultaneity matrix is an × matrix of numbers. It is constructed according to a set of -bit solutions. The matrix element mij is the degree of linkage between bit positions i ...