• No se han encontrado resultados

Optimization of coefficients of lists of polynomials by evolutionary algorithms

N/A
N/A
Protected

Academic year: 2020

Share "Optimization of coefficients of lists of polynomials by evolutionary algorithms"

Copied!
9
0
0

Texto completo

Loading

Figure

Figure 1: The main workflow of an evolution strategy
Table 1: Algorithm parameter settings used for solving the here discussed coefficients optimization problem.
Table 2: Test results. For each algorithm configuration we give the average result qualities achieved for problem instances Ex1 and
Figure 3: Fitness landscape analysis for example Ex2. All possible solution candidates for the here used problem with α 1 and α 3 set optimally (α 1 = −25, α 3 = −34) are created, their fitness is drawn on the z-axis

Referencias

Documento similar

In this paper the term Profile refers to a combination of visual descriptors and the term Levels of detail refer to the different combinations of elements of a specific

As strengths of this paper, we must highlight the novelty and robustness of performing a comprehensive statistical analysis of the impact that the different pre-processing

In light of this, this paper presents the discrete–continuous optimization methodology for solving the problem of optimal integration of PV DGs in electrical networks; by implementing

The structure of this paper is as follows. In Section 2, we introduce basic aspects of mobile agent technology, which is important for this work. In Section 3, we describe and model

In this section we analyze the performance of the Nash equilibrium in terms of two standard metrics for efficiency and fairness: (i) the price of anarchy, which gives the loss

Independently, we tried an experimental approach to the problem of motility based on the analysis of the variations in the speckle pattern produced by a deposit of living cells.

Given that a number of epidemiological studies indicate that the PM2.5 fraction may be responsible for the adverse effects of PM10 (e.g. Dockery et al., 1993; Swartz et al.,

A similar problem – which is closely related to the original sum-product conjecture – is to bound the number of sums and ratios along the edges of a graph2. We give upper and