160 search results - page 13 / 32 » Boosting Distributed Constraint Satisfaction |
IJCAI
2007
13 years 9 months ago
2007
Constraint Satisfaction Problems (CSPs) are ubiquitous in Artificial Intelligence. The backtrack algorithms that maintain some local consistency during search have become the de ...
AI
2005
Springer
13 years 7 months ago
2005
Springer
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constr...
CP
2003
Springer
14 years 1 months ago
2003
Springer
A reason to distribute constraint satisfaction is privacy: agents may not want to share their values, and they may wish to keep constraints as private as possible. In this paper, w...
FLAIRS
2004
13 years 9 months ago
2004
The integration of methods of Constraint Programming and Multi-Agent-Systems is discussed in this paper. We describe different agent topologies for Constraint Satisfaction Problem...
NIPS
2007
13 years 9 months ago
2007
We present a novel boosting algorithm, called SoftBoost, designed for sets of binary labeled examples that are not necessarily separable by convex combinations of base hypotheses....