Abstract | ||
---|---|---|
Integer time series are often subject to constraints on the aggregation of the integer features of all occurrences of some pattern within the series. For example, the number of inflexions may be constrained, or the sum of the peak maxima, or the minimum of the peak widths. It is currently unknown how to maintain domain consistency efficiently on such constraints. We propose parametric ways of systematically deriving glue constraints, which are a particular kind of implied constraints, as well as aggregation bounds that can be added to the decomposition of time-series constraints [5]. We evaluate the beneficial propagation impact of the derived implied constraints and bounds, both alone and together. |
Year | DOI | Venue |
---|---|---|
2016 | 10.1007/978-3-319-44953-1_2 | PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, CP 2016 |
Field | DocType | Volume |
Integer,Discrete mathematics,Mathematical optimization,Deterministic finite automaton,Constraint (mathematics),Constraint programming,Finite-state machine,Parametric statistics,Scleronomous,Maxima,Mathematics | Conference | 9892 |
ISSN | Citations | PageRank |
0302-9743 | 3 | 0.41 |
References | Authors | |
8 | 7 |
Name | Order | Citations | PageRank |
---|---|---|---|
Ekaterina Arafailova | 1 | 12 | 2.68 |
Nicolas Beldiceanu | 2 | 547 | 51.14 |
Mats Carlsson | 3 | 975 | 79.24 |
Pierre Flener | 4 | 533 | 50.28 |
María Andreína Francísco Rodriguez | 5 | 13 | 2.05 |
Justin Pearson | 6 | 237 | 24.28 |
Helmut Simonis | 7 | 908 | 122.73 |