2864 search results - page 346 / 573 » Constraint Programming in OPL |
PEPM
1994
ACM
14 years 1 months ago
1994
ACM
We present an efficient base algorithm for binding-time analysis based on constraint solving and the union-find algorithm. In practice it has been used to handle all of Standard M...
CSLP
2004
Springer
14 years 29 days ago
2004
Springer
Many tasks in computational linguistics can be regarded as configuration problems. In this paper, we introduce the notion of lexicalised multi-dimensional configuration problems (l...
CP
2006
Springer
14 years 28 days ago
2006
Springer
Abstract. Invariants that incrementally maintain the value of expresder assignments to their variables are a natural abstraction to build high-level local search algorithms. But th...
CSCLP
2006
Springer
14 years 27 days ago
2006
Springer
Abstract. Constraint Handling Rules (CHR) is a concurrent, committed-choice, rule-based language. One of the first CHR programs is the classic constraint solver for syntactic equal...
EUROPAR
1997
Springer
14 years 23 days ago
1997
Springer
Abstract. The serialization constraints induced by the detection and enforcement of true data dependences have always been regarded as requirements for correct execution. We propos...