250 search results - page 4 / 50 » The complexity of temporal constraint satisfaction problems |
DAGSTUHL
2008
15 years 1 months ago
2008
Allowing templates with infinite domains greatly expands the range of problems that can be formulated as a non-uniform constraint satisfaction problem. It turns out that many CSPs ...
CP
1995
Springer
15 years 3 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 ...
123
click to vote
CSCLP
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Time granularity constraint reasoning is likely to have a relevant role in emerging applications like GIS, time management in the Web and Personal Information Management ...
135
click to vote
CONSTRAINTS
1998
14 years 11 months ago
1998
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
EMNLP
2007
15 years 1 months ago
2007
We present an adaptation of constraint satisfaction inference (Canisius et al., 2006b) for predicting dependency trees. Three different classifiers are trained to predict weighte...