#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2013

2016

- This year (0)
- Last 5 years (7)
- Last 10 years (7)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Ekaterina Arafailova, Nicolas Beldiceanu, +5 authors Helmut Simonis
- ArXiv
- 2016

First this report presents a restricted set of finite transducers used to synthesise structural time-series constraints described by means of a multi-layered function composition scheme. Second it provides the corresponding synthesised catalogue of structural time-series constraints where each constraint is explicitly described in terms of automata with… (More)

Consider a constraint on a sequence of variables functionally determining a result variable that is unchanged under reversal of the sequence. Most such constraints have a compact encoding via an automaton augmented with accumulators, but it is unknown how to maintain domain consistency efficiently for most of them. Using such an automaton for such a… (More)

Basic: linear inequalities containing only current accumulator values (i.e. ci≥0) History Variables: number of previous accumulator values (i.e. ci-2+1≥ci) State Variable: include a variable q representing the current state (i.e. ci-ci-1≤q) State Specific Implied Constraints: generate ICs that hold at specific states (i.e. q=s ⇒ ci=ci-1) Index Variable:… (More)

- Ekaterina Arafailova, Nicolas Beldiceanu, +4 authors Helmut Simonis
- CPAIOR
- 2016

A checker for a constraint on a variable sequence can often be compactly specified by an automaton, possibly with accumulators, that consumes the sequence of values taken by the variables; such an automaton can also be used to decompose its specified constraint into a conjunction of logical constraints. The inference achieved by this decomposition in a CP… (More)

- María Andreína Francisco Rodríguez, Pierre Flener, Justin Pearson
- 2013 IEEE 25th International Conference on Tools…
- 2013

Automata, possibly with counters, allow many constraints to be expressed in a simple and high-level way. An automaton induces a decomposition into a conjunction of already implemented constraints. Generalised arc consistency is not generally maintained on decompositions induced by counter automata with more than one state or counter. To improve propagation… (More)

- Ekaterina Arafailova, Nicolas Beldiceanu, +4 authors Helmut Simonis
- CP
- 2016

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… (More)

- Nipun Agarwal, Aman Goyal, +17 authors Manish Arora
- 2015

The future of computation is the GPU, i.e. the Graphical Processing Unit. The graphics cards have shown the tremendous power in the field of image processing and accelerated generating of 3D scenes, and the computational capability of GPUs have promised its developing into great parallel computing units. It is quite simple to program a graphical processor… (More)

- ‹
- 1
- ›