Deriving generic bounds for time-series constraints based on regular expressions characteristics
From MaRDI portal
Publication:1706597
DOI10.1007/s10601-017-9276-zzbMath1396.90047arXiv1703.06783OpenAlexW2604433850MaRDI QIDQ1706597
Ekaterina Arafailova, Nicolas Beldiceanu, Helmut Simonis
Publication date: 22 March 2018
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.06783
sharp boundsglobal constraintstime-series constraintsquantitative regular expressionsregular programming
Related Items
Cites Work
- Unnamed Item
- Using finite transducers for describing and synthesising structural time-series constraints
- Approximate comparison of functions computed by distance automata
- A \texttt{cost-regular} based hybrid column generation approach
- Regular Programming for Quantitative Properties of Data Streams
- Time-Series Constraints: Improvements and Application in CP and MIP Contexts
- On the definition of a family of automata
- Regular Functions and Cost Register Automata
- Algorithms on Strings
- Principles and Practice of Constraint Programming – CP 2004
- Principles and Practice of Constraint Programming – CP 2004