In this research work a large set of the classical numerical functions were taken into account in order to understand both the search capability and the ability to escape from a lo...
Vincenzo Cutello, Giuseppe Nicosia, Mario Pavone, ...
The problem attempted in this paper is to select a sample from a large set where the sample is required to have a particular average property. The problem can be expressed as an o...
During our earlier research, it was recognised that in order to be successful with an indirect genetic algorithm approach using a decoder, the decoder has to strike a balance betw...
Abstract- Theoretical analysis of the dynamics of evolutionary algorithms is believed to be very important to understand the search behavior of evolutionary algorithms and to devel...
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...