559 search results - page 94 / 112 » Fast SDP Algorithms for Constraint Satisfaction Problems |
ICDCS
2007
IEEE
14 years 3 months ago
2007
IEEE
Learning the underlying model from distributed data is often useful for many distributed systems. In this paper, we study the problem of learning a non-parametric model from distr...
ICRA
2009
IEEE
13 years 6 months ago
2009
IEEE
We propose a novel method for multi-robot plan adaptation which can be used for adapting existing spatial plans of robotic teams to new environments or imitating collaborative spat...
AAAI
2010
13 years 10 months ago
2010
We consider optimizing the coalition structure in Coalitional Skill Games (CSGs), a succinct representation of coalitional games (Bachrach and Rosenschein 2008). In CSGs, the valu...
ICIP
2010
IEEE
13 years 6 months ago
2010
IEEE
The 2.1D sketch is a layered representation of occluding and occluded surfaces of the scene. Extracting the 2.1D sketch from a single image is a difficult and important problem ar...
SAT
2005
Springer
14 years 2 months ago
2005
Springer
Much attention has been given in recent years to the problem of finding Minimally Unsatisfiable Subformulas (MUSes) of Boolean formulas. In this paper, we present a new view of the...