This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Com...
This paper presents an approach for constructing improved visual representations of high dimensional objective spaces using virtual reality. These spaces arise from the solution of...
— The computation of periodic orbits of nonlinear mappings is very important for studying and better understanding the dynamics of complex systems. Evolutionary algorithms have s...
Y. G. Petalas, Konstantinos E. Parsopoulos, Michae...
— JADE is a recent variant of Differential Evolution (DE) for numerical optimization, which has been reported to obtain some promising results in experimental study. However, we ...
Recent studies [13, 18] have shown that clearing schemes are efficient multi-modal optimization methods. They efficiently reduce genetic drift which is the direct reason for prema...