In this paper, we present a constraint programming approach for the service consolidation problem that is being currently tackled by Neptuny, Milan. The problem is defined as: Giv...
This paper proposes an estimation of distribution algorithm (EDA) aiming at addressing globally multimodal problems, i.e., problems that present several global optima. It can be r...
In cooperative pathfinding problems, non-interfering paths that bring each agent from its current state to its goal state must be planned for multiple agents. We present the first...
New methods to generate hard random problem instances have driven progress on algorithms for deduction and constraint satisfaction. Recently Achlioptas et al. (AAAI 2000) introduc...
Henry A. Kautz, Yongshao Ruan, Dimitris Achlioptas...
Deceptive problems have always been considered difficult for Genetic Algorithms. To cope with this characteristic, the literature has proposed the use of Parallel Genetic Algorith...