We address the problem of learning distance metrics using side-information in the form of groups of "similar" points. We propose to use the RCA algorithm, which is a sim...
We present a new derivation of eļ¬cient algorithms for a class of optimization problems called maximum marking problems. We extend the class of weight functions used in the speciļ...
We consider soft constraint problems where some of the preferences may be unspeciļ¬ed. This models, for example, situations with several agents providing the data, or with possibl...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
This paper proposes a clustering method SOMAK, which is composed by Self-Organizing Maps (SOM) followed by the Ant K-means (AK) algorithm. The aim of this method is not to ļ¬nd an...
Jefferson R. Souza, Teresa Bernarda Ludermir, Lean...
In this paper we investigate an approach to provide approximate, anytime algorithms for DCOPs that can provide quality guarantees. At this aim, we propose the divide-and-coordinat...
Meritxell Vinyals, Marc Pujol, Juan A. Rodrí...