We consider the problem of preemptive scheduling on uniformly related machines. We present a semi-online algorithm which, if the optimal makespan is given in advance, produces an ...
We present a tool for solving and plotting train schedules which has been developed in collaboration with the National Network of Spanish Railways (RENFE). This tool transforms rai...
Federico Barber, Miguel A. Salido, Laura Paola Ing...
Point matching is the task of finding a set of correspondences between two sets of points under some geometric transformation. A local search algorithm for point matching is pres...
This paper presents a new heuristic algorithm for the graph coloring problem based on a combination of genetic algorithms and simulated annealing. Our algorithm exploits a novel cr...
Dimitris Fotakis, Spiridon D. Likothanassis, Stama...
The HW/SW partitioning problem addressed in this paper is one of the key steps in the co-design flow of heterogeneous embedded systems. Generally the aim is to provide solutions t...
Luc Bianco, Michel Auguin, Guy Gogniat, Alain Pega...