717 search results - page 84 / 144 » Weak-Commitment Search for Solving Constraint Satisfaction P... |
AAAI
2004
14 years 11 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...
EVOW
2001
Springer
15 years 2 months ago
2001
Springer
This work introduces a highly constrained school timetabling problem which was modeled from the requirements of a German high school. The concept for solving the problem uses a hyb...
KI
2002
Springer
14 years 9 months ago
2002
Springer
In the previous two decades, a number of qualitative constraint calculi have been developed, which are used to represent and reason about spatial configurations. A common property...
100
click to vote
AISC
2008
Springer
14 years 12 months ago
2008
Springer
We describe the use of symbolic algebraic computation allied with AI search techniques, applied to the problem of the identification, enumeration and storage of all monoids of orde...
ATAL
2003
Springer
15 years 3 months ago
2003
Springer
We present a new polynomial-space algorithm, called Adopt, for distributed constraint optimization (DCOP). DCOP is able to model a large class of collaboration problems in multi-a...