Abstract. We consider the single machine scheduling problem to minimize the average weighted completion time under precedence constrains. Improving on the various 2-approximation a...
— Different coherence dimensions can be considered to improve the performances of an algorithm for computing collision translations of pairs of convex polyhedra. The algorithm’...
Abstract. Several research groups have grappled with the problem of characterizing and developing practical approaches for implementing adjustable autonomy and mixed-initiative int...
Jeffrey M. Bradshaw, Paul J. Feltovich, Hyuckchul ...
A computationally fast procedure for identifying outliers is presented, that is particularly effective in high dimensions. This algorithm utilizes simple properties of principal c...
We propose a method for drawing AS graph data using 2.5D graph visualization. In order to bring out the pure graph structure of the AS graph we consider its core hierarchy. The k-c...
Michael Baur, Ulrik Brandes, Marco Gaertler, Dorot...