Sciweavers

3889 search results - page 576 / 778
» A Framework for Optimizing Paper Matching
Sort
View
AAAI
1994
15 years 7 months ago
A Computational Market Model for Distributed Configuration Design
This paper presents a precise market model for a well-defined class of distributed configuration design problems. Given a design problem, the model defines a computational economy...
Michael P. Wellman
ECAI
2010
Springer
15 years 7 months ago
Egalitarian Utilities Divide-and-Coordinate: Stop arguing about decisions, let's share rewards!
Abstract. In this paper we formulate a novel Divide-andCoordinate (DaC) algorithm, the so-called Egalitarian Utilities Divide-and-Coordinate (EU-DaC) algorithm. The Divide-andCoord...
Meritxell Vinyals, Juan A. Rodríguez-Aguila...
ICASSP
2010
IEEE
15 years 6 months ago
Hierarchical Gaussian Mixture Model
Gaussian mixture models (GMMs) are a convenient and essential tool for the estimation of probability density functions. Although GMMs are used in many research domains from image ...
Vincent Garcia, Frank Nielsen, Richard Nock
ALGORITHMICA
2008
131views more  ALGORITHMICA 2008»
15 years 6 months ago
Sorting and Searching in Faulty Memories
In this paper we investigate the design and analysis of algorithms resilient to memory faults. We focus on algorithms that, despite the corruption of some memory values during the...
Irene Finocchi, Giuseppe F. Italiano
AUTOMATICA
2008
86views more  AUTOMATICA 2008»
15 years 6 months ago
Notes on averaging over acyclic digraphs and discrete coverage control
In this paper we study averaging algorithms and coverage control laws in a unified light. First, we characterize the convergence properties of averaging algorithms over acyclic di...
Chunkai Gao, Jorge Cortés, Francesco Bullo