10901 search results - page 12 / 2181 » Approximations in Distributed Optimization |
101
click to vote
APPROX
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
CDC
2009
IEEE
15 years 4 months ago
2009
IEEE
— For the optimal approximation of multivariate Gaussian densities by means of Dirac mixtures, i.e., by means of a sum of weighted Dirac distributions on a continuous domain, a n...
ATAL
2007
Springer
15 years 3 months ago
2007
Springer
This paper addresses distributed task allocation in complex scenarios modeled using the distributed constraint optimization problem (DCOP) formalism. We propose and evaluate a nov...
104
click to vote
SODA
2001
ACM
15 years 1 months ago
2001
ACM
Bin covering takes as input a list of items with sizes in (0 1) and places them into bins of unit demand so as to maximize the number of bins whose demand is satis ed. This is in ...
AI
2005
Springer
14 years 11 months ago
2005
Springer
The Distributed Constraint Optimization Problem (DCOP) is able to model a wide variety of distributed reasoning tasks that arise in multiagent systems. Unfortunately, existing met...