1381 search results - page 120 / 277 » Computational Complexity of Constraint Satisfaction |
136
click to vote
SBACPAD
2007
IEEE
15 years 10 months ago
2007
IEEE
— Telemedicine, distance learning and e-commerce applications impose time constraints directly related to the efficacy of their operations. In order to offer reliability levels ...
134
click to vote
IAT
2006
IEEE
15 years 10 months ago
2006
IEEE
The Distributed Probabilistic Protocol (DPP) is a new, approximate algorithm for solving Distributed Constraint Satisfaction Problems (DCSPs) that exploits prior knowledge to impr...
140
click to vote
EVOW
2010
Springer
15 years 8 months ago
2010
Springer
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...
160
click to vote
AAAI
2010
15 years 5 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...
164
click to vote
AAMAS
1999
Springer
15 years 4 months ago
1999
Springer
Interaction protocols are specific, often standard, constraints on the behaviors of autonomous agents in a multiagent system. Protocols are essential to the functioning of open sys...