1093 search results - page 64 / 219 » Clustering from Constraint Graphs |
139
click to vote
CP
2005
Springer
15 years 5 months ago
2005
Springer
Boolean Constraint Propagation (BCP) is recognized as one of the most useful technique for efficient satisfiability checking. In this paper a new extension of the scope of boole...
117
click to vote
ICMT
2010
Springer
15 years 8 months ago
2010
Springer
Graph transformation (GT) is being increasingly used in Model Driven Engineering (MDE) to describe in-place transformations like animations and refactorings. For its practical use,...
144
Voted
AAAI
2011
14 years 3 months ago
2011
In this paper, we model the pair-wise similarities of a set of documents as a weighted network with a single cutoff parameter. Such a network can be thought of an ensemble of unwe...
100
Voted
DAC
2002
ACM
16 years 4 months ago
2002
ACM
Constraint-driven Communication Synthesis enables the automatic design of the communication architecture of a complex system from a library of pre-defined Intellectual Property (I...
159
click to vote
AAMAS
2011
Springer
14 years 10 months ago
2011
Springer
In this paper, we consider algorithms for distributed constraint optimisation problems (DCOPs). Using a potential game characterisation of DCOPs, we decompose six distributed DCOP...