980 search results - page 38 / 196 » Decentralized Constraint Satisfaction |
129
click to vote
JCSS
2008
15 years 1 months ago
2008
In this paper we derive a generic form of structural decomposition for the constraint satisfaction problem, which we call a guarded decomposition. We show that many existing decom...
119
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
123
click to vote
JAIR
2010
15 years 11 days ago
2010
Diagrammatic reasoning (DR) is pervasive in human problem solving as a powerful adjunct to symbolic reasoning based on language-like representations. The research reported in this...
118
click to vote
AGENTS
2001
Springer
15 years 6 months ago
2001
Springer
Conflict resolution is a critical problem in distributed and collaborative multi-agent systems. Negotiation via argumentation (NVA), where agents provide explicit arguments or ju...
145
click to vote
ATAL
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. In distributed resource allocation a set of agents must assign their resources to a set of tasks. This problem arises in many real-world domains such as distributed senso...