The MEMOIR framework supports researchers working with a vast quantity of distributed information, by assisting them in finding both relevant documents and researchers with relate...
David De Roure, Wendy Hall, Siegfried Reich, Aggel...
Abstract. We describe in this paper Ant-P-solver, a generic constraint solver based on the Ant Colony Optimization (ACO) metaheuristic. The ACO metaheuristic takes inspiration on t...
The MEMOIR project supports researchers working with a vast quantity of distributed information, by assisting them in finding both relevant documents and researchers with related ...
David De Roure, Wendy Hall, Siegfried Reich, Aggel...
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...
Carlos Fernandes, Agostinho C. Rosa, Vitorino Ramo...