Machine scheduling is a critical problem in industries where products are custom-designed. The wide range of products, the lack of previous experiences in manufacturing, and the s...
Juan Carlos Vidal, Manuel Mucientes, Alberto Bugar...
The problem of solving sparse Systems of Linear Algebraic Equations (SLAE) by parallel Monte Carlo numerical methods is considered. The almost optimal Monte Carlo algorithms are pr...
A unified framework is applied to solving various sequence comparison problems for run-length encoded strings. All of these algorithms take O(min{mn , m n}) time and O(max{m, n}) s...
Abstract One of the goals envisioned by Grid computing is to make the execution of both computational and data-intensive problems possible. A key problem is finding the optimal set...
Marc De Leenheer, Pieter Thysebaert, Bruno Volckae...
In this paper, we propose the first wire density driven global routing that considers CMP variation and timing. To enable CMP awareness during global routing, we propose a compac...