4743 search results - page 268 / 949 » The PlusCal Algorithm Language |
122
Voted
CP
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. This article deals with global constraints for which the set of solutions can be recognized by an extended finite automaton whose size is bounded by a polynomial in n, w...
109
Voted
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
We give a simple formulation of Karr’s algorithm for computing all affine relationships in affine programs. This simplified algorithm runs in time O(nk3 ) where n is the progr...
125
Voted
PRICAI
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. The problem of interpreting Natural Language (NL) discourse is generally of exponential complexity. However, since interactions with users must be conducted in real time,...
135
Voted
ICALP
2003
Springer
15 years 9 months ago
2003
Springer
We consider the general on-line two server problem in which at each step both servers receive a request, which is a point in a metric space. One of the servers has to be moved to i...
116
Voted
CP
2007
Springer
15 years 10 months ago
2007
Springer
Constraints have played a central role in cp because they capture key substructures of a problem and efficiently exploit them to boost inference. This paper intends to do the same ...