4666 search results - page 391 / 934 » Equations on Timed Languages |
164
click to vote
CP
2007
Springer
16 years 1 months ago
2007
Springer
Deviation is a recent constraint to balance a set of variables with respect to a given mean. We show that the propagators recently introduced are not bound-consistent when the mean...
157
click to vote
CP
2005
Springer
16 years 13 days ago
2005
Springer
Methods exploiting tree-decompositions seem to provide the best approach for solving constraint networks w.r.t. the theoretical time complexity. However, they have not shown a real...
146
click to vote
ICALP
2005
Springer
16 years 12 days ago
2005
Springer
Abstract. We study the problem of determining the complexity of optimal comparison-based in-place sorting when the key length, k, is not a constant. We present the first algorithm...
307
click to vote
POPL
2004
ACM
16 years 7 months ago
2004
ACM
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
190
click to vote
FPCA
1989
15 years 11 months ago
1989
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...