We consider the classical problem of scheduling parallel unrelated machines. Each job is to be processed by exactly one machine. Processing job j on machine i requires time pij . ...
—To rapidly and accurately search the corresponding points along scan-lines, rectification of stereo pairs are performed so that corresponding epipolar lines are parallel to the ...
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
Abstract. This paper presents a real time parallel hardware architecture for image feature detection based on the SIFT (Scale Invariant Feature Transform) algorithm. This architect...
Vanderlei Bonato, Eduardo Marques, George A. Const...
Many of the optimization problems from the real world are multiobjective in nature, and the reference algorithm for multiobjective optimization is NSGA-II. Frequently, these probl...