Most applications of evolutionary algorithms (EAs) deal with static optimization problems. However, in recent years, there has been a growing interest in timevarying (dynamic) prob...
Rasmus K. Ursem, Thiemo Krink, Mikkel T. Jensen, Z...
—In this paper, we study an online bipartite matching problem, motivated by applications in wireless communication, content delivery, and job scheduling. In our problem, we have ...
We propose a new discontinuous Galerkin (DG) method based on [9] to solve a class of Hamilton-Jacobi equations that arises from optimal control problems. These equations are connec...
Cooperative co-evolution is often used to solve difficult optimization problems by means of problem decomposition. Its performance for such tasks can vary widely from good to disa...
An approach to handle the complex dynamics of a multi-agent system is based on distinguishing aggregation levels by structuring the system into parts or components. The behavior of...