— Computing optimal paths for mobile robots is an interesting and important problem. This paper presents a method to compute the shortest path for a differential-drive mobile rob...
A novel method is proposed for matching articulated objects in cluttered videos. The method needs only a single exemplar image of the target object. Instead of using a small set o...
Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...
Abstract— We consider the simplest model for controlling the rotation of a molecule by the action of an electric field, namely a quantum planar pendulum. This problem consists i...
Ugo V. Boscain, Thomas Chambrion, Paolo Mason, Mar...
We consider the following fundamental scheduling problem. The input consists of n jobs to be scheduled on a set of machines of bounded capacities. Each job is associated with a re...