1264 search results - page 64 / 253 » The framework approach for constraint satisfaction |
167
click to vote
AAAI
2004
15 years 7 months ago
2004
We present an efficient approach to adding soft constraints, in the form of preferences, to Disjunctive Temporal Problems (DTPs) and their subclass Temporal Constraint Satisfactio...
191
click to vote
ASWEC
2006
IEEE
16 years 7 days ago
2006
IEEE
Web services are designed for composition and use by third parties through dynamic discovery. As such, the issue of interoperability between services is of great importance to ens...
142
click to vote
AIR
2004
15 years 6 months ago
2004
Abstract. In this work we study an over-constrained scheduling problem where constraints cannot be relaxed. This problem originates from a local defense agency where activities to ...
180
click to vote
ATAL
2003
Springer
15 years 11 months ago
2003
Springer
Given a large group of cooperative agents, selecting the right coordination or conflict resolution strategy can have a significant impact on their performance (e.g., speed of co...
150
click to vote
CP
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Among backtracking based algorithms for constraint satisfaction problems (CSPs), algorithms employing constraint propagation, like forward checking (FC) and MAC, have had...