477 search results - page 7 / 96 » Argumentation as distributed constraint satisfaction: applic... |
SARA
2005
Springer
14 years 1 months ago
2005
Springer
This paper reconsiders the problems of discovering symmetries in constraint satisfaction problems (CSPs). It proposes a compositional approach which derives symmetries of the appli...
DSOM
2004
Springer
14 years 1 months ago
2004
Springer
In this paper, we describe an approach for automatically generating configurations for complex applications. Automated generation of system co nfigurations is required to allow lar...
JUCS
2007
13 years 7 months ago
2007
: The distribution of overlaps of solutions of a random constraint satisfaction problem (CSP) is an indicator of the overall geometry of its solution space. For random k-SAT, nonri...
GCC
2003
Springer
14 years 28 days ago
2003
Springer
A novel combination of genetic algorithms and constraint satisfaction modelling for the solution of two and multi-layer over-thecell channel routing problems is presented. The two ...
CP
1995
Springer
13 years 11 months ago
1995
Springer
We present a method for finding optimal partial solutions to overconstrained instances of the Disjunctive Temporal Problems (DTP). The solutions are optimal in that they satisfy ...