Evolutionary algorithms (EAs) are merely blind search algorithms, which only make use of the relative fitness of solutions, but completely ignore the nature of the problem. Their performance can be improved by using new multirecombinative approaches, which provide a good…

This work is focussed on the development and analysis of a new class of algorithms, called cellular memetic algorithms (cMAs), which will be evaluated here on the satisfiability problem (SAT). For describing a cMA, we study the effects of adding…

The increment in the volume and quality of data in astrophysics and cosmology requires new computational methods for producing high-quality scientific results. This fact, still far from being temporary, will aggravate in the near future due to the improvements in…