This paper focuses on scheduling different hard real-time applications on a uniprocessor when the earliest deadline first algorithm is used as the local scheduler, and the global ...
— We consider feed-forward packet switched networks with fixed routing and random congestion losses. Users of the network are assumed to be greedy in the sense that each user in...
Abstract— This article presents an efficient and mature visionbased navigation algorithm based on a sensory-motor learning. Neither Cartesian nor topological map is required, bu...
Christophe Giovannangeli, Philippe Gaussier, Gael ...
The approximate searching problem on compressed text tries to find all the matches of a pattern in a compressed text, without decompressing it and considering that the match of th...
Abstract— In the context of virtualized reality based telemicromanipulation, we present in this paper a visual calibration technique for optical microscope coupled with a CCD cam...