We study the problem of finding good alternative routes in road networks. We look for routes that are substantially different from the shortest path, have small stretch, and are ...
Ittai Abraham, Daniel Delling, Andrew V. Goldberg,...
We consider the estimation of the locations of multiple transmitters based on received signal strength measurements at a network of randomly-placed receivers. We generalize the ex...
Jill K. Nelson, Jaime E. Almodovar, Maya R. Gupta,...
We present a cache oblivious algorithm for stencil computations, which arise for example in finite-difference methods. Our algorithm applies to arbitrary stencils in n-dimension...
We study the partitioning of temporal planning problems formulated as mixed-integer nonlinear programming problems, develop methods to reduce the search space of partitioned subpr...
In this paper, a bottom-up hierarchical genetic algorithm is proposed to visualize clustered data into a planar graph. To achieve global optimization by accelerating local optimiz...