Skip to search formSkip to main contentSkip to account menu

Regular constraint

In artificial intelligence and operations research, a regular constraint is a kind of global constraint. It can be used to solve a particular type of… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
The rotating workforce scheduling problem aims to schedule workers satisfying shift sequence constraints and ensuring enough… 
2013
2013
Many real-life problems are over-constrained, so that no solution satisfying all their constraints exists. Soft constraints, with… 
2012
2012
Many global constraints can be described by a regular expression or a DFA. Originally, the regular constraint, uses a DFA to… 
2009
2009
User requirements, building codes, construction rules and regulations imply constraints on a building design. Additional… 
2009
2009
In the study of ALM, how to improve the performance of multicast system is a hotspot. Theoretical study shows that network coding… 
2009
2009
We investigate soft open constraints. We generalize and unify classes of soft constraints and adapt them to the open setting. We… 
2009
2009
This work focuses on the Regular constraint. We propose a new consistency algorithm which concentrates on important charac te… 
2008
2008
This thesis explores three new techniques for increasing the efficiency of constraint propagation: support for incremental… 
2008
2008
The regular constraint [5] is a powerful global constraint with many possible uses. It was introduced to model certain common… 
2007
2007
Many optimisation problems contain substructures involving constraints on sequences of decision variables. Such constraints can…