Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
Vincenzo Auletta, Ioannis Caragiannis, Christos Ka...
Screening is an important task to convert a continuoustone image into a binary image with pure black and white pixels. The main contribution of this paper is to show a new algorit...
Many bio-inspired algorithms (evolutionary algorithms, artificial immune systems, particle swarm optimisation, ant colony optimisation, …) are based on populations of agents. Ste...
This paper describes a general scheme to convert sequential ant-based algorithms into parallel shared memory algorithms. The scheme is applied to an ant-based algorithm for the ma...
Thang Nguyen Bui, ThanhVu H. Nguyen, Joseph R. Riz...
This paper presents an algorithm for solving a number of generalized graph coloring problems. Specifically, it gives an agent-based algorithm for the Bandwidth Coloring problem. U...