Invariants for time-series constraints
From MaRDI portal
Publication:823762
DOI10.1007/s10601-020-09308-zzbMath1479.90114OpenAlexW3043812405MaRDI QIDQ823762
Nicolas Beldiceanu, Helmut Simonis, Ekaterina Arafailova
Publication date: 16 December 2021
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-020-09308-z
finite automatonlinear invariantnonlinear invariantparameterised invariantregister automatontime-series constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Using finite transducers for describing and synthesising structural time-series constraints
- Integrated methods for optimization
- Reformulation of global constraints based on constraints checkers
- All-different polytopes
- Deriving generic bounds for time-series constraints based on regular expressions characteristics
- The learnability of unions of two rectangles in the two-dimensional discretized space
- Introducing global constraints in CHIP
- Constraint-based optimization and utility elicitation using the minimax decision criterion
- An efficient algorithm for determining the convex hull of a finite planar set
- Time-Series Constraints: Improvements and Application in CP and MIP Contexts
- Symbolic finite state transducers
- Graph Invariants as Necessary Conditions for Global Constraints
- Sequencing and Counting with the multicost-regular Constraint
- Exact Learning of Discretized Geometric Concepts
- Algorithms on Strings
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- The Theory of Statistical Decision
- Principles and Practice of Constraint Programming – CP 2004
This page was built for publication: Invariants for time-series constraints