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í...
Selecting the right parties to interact with is a fundamental problem in open and dynamic environments. The problem is exemplified when the number of interacting parties is high a...
This paper presents an approach to automatically optimize the retrieval quality of ranking functions. Taking a Swarm Intelligence perspective, we present a novel method, SwarmRank...
Ernesto Diaz-Aviles, Wolfgang Nejdl, Lars Schmidt-...
We propose a probabilistic model for the Independent Vector Analysis approach to blind deconvolution and derive an asymptotic Newton method to estimate the model by Maximum Likelih...
Jason A. Palmer, Kenneth Kreutz-Delgado, Scott Mak...
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...