A depth-first search algorithm can be used to find optimal solutions of a Constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g.,...
A common method for dealing with overload conditions in periodic task systems is to reduce the load by enlarging activation periods. When a periodic task implements a digital cont...
Giorgio C. Buttazzo, Manel Velasco, Pau Mart&iacut...
We introduce two appearance-based methods for clustering a set of images of 3-D objects, acquired under varying illumination conditions, into disjoint subsets corresponding to ind...
In this work we consider the task of relaxing the i.i.d assumption in online pattern recognition (or classification), aiming to make existing learning algorithms applicable to a ...
In this paper, we present a semantical approach to multi-agent belief revision and belief update. For this, we introduce relational structures called conditional doxastic models (...