An asymmetric binary covering code of length n and radius R is a subset C of the n-cube Qn such that every vector x Qn can be obtained from some vector c C by changing at most R...
Joshua N. Cooper, Robert B. Ellis, Andrew B. Kahng
Even the best laid plans can fail, and robot plans executed in real world domains tend to do so often. The ability of a robot to reliably monitor the execution of plans and detect...
Abdelbaki Bouguerra, Lars Karlsson, Alessandro Saf...
This paper introduces the notion of temporally constrained ranked retrieval, which, given a query and a time constraint, produces the best possible ranked list within the specifi...
This work is about solving the global localization issue for mobile robots operating in large and cooperative environments. It tackles the problem of estimating the pose of a robo...
Andreu Corominas Murtra, Josep Maria Mirats i Tur,...
Mashups are situational applications that join multiple sources to better meet the information needs of Web users. Web sources can be huge databases behind query interfaces, which...