206 search results - page 13 / 42 » Distributed Partial Constraint Satisfaction Problem |
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...
IAT
2007
IEEE
14 years 2 months ago
2007
IEEE
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
The predominant knowledge-based approach to automated model construction, compositional modelling, employs a set of models of particular functional components. Its inference mecha...
ASE
1998
13 years 7 months ago
1998
The process of understanding a source code in a high-level programming language involves complex computation. Given a piece of legacy code and a library of program plan templates, ...
EAAI
2008
13 years 7 months ago
2008
Nowadays, many real problems can be formalized as Distributed CSPs. A distributed constraint satisfaction problem (DisCSP) is a CSP in which variables and constraints are distribu...