Genetic Algorithms have widely been used for solving optimization problems in stationary environments. In recent years, there has been a growing interest for investigating and imp...
The behavior of many algorithms is heavily determined by the input data. Furthermore, this often means that multiple and completely different execution paths can be followed, also...
Marc Leeman, Chantal Ykman-Couvreur, David Atienza...
A new efficient MRF optimization algorithm, called FastPD, is proposed, which generalizes -expansion. One of its main advantages is that it offers a substantial speedup over that ...
In this paper, we present a technique for reducing the overhead of collecting path profiles in the context of a dynamic optimizer. The key idea to our approach, called Targeted Pa...
In this paper, the dynamic multi-swarm particle swarm optimizer (DMS-PSO) and a sub-regional harmony search (SHS) are hybridized to obtain DMS-PSO-SHS. A Modified multi-trajectory ...