We consider the problem of approximating a set P of n points in Rd by a collection of j-dimensional flats, and extensions thereof, under the standard median / mean / center measur...
We present a fully distributed multi-agent planning algorithm. Our methodology uses distributed constraint satisfaction to coordinate between agents, and local planning to ensure ...
The problem of merging multiple sources information is central in many information processing areas such as databases integration problems, multiple criteria decision making, exper...
Salem Benferhat, Didier Dubois, Souhila Kaci, Henr...
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
To reason about geographical objects, it is not only necessary to have more or less complete information about where these objects are located in space, but also how they can chang...