作者：
Petit, thierry
4 Rue Alfred Kastler Nantes Cedex 3 FR-44307 France
Many constraintprogramming models use integer cost variables aggregated in an objective criterion. In this context, some constraints involving exclusively cost variables are often imposed. Such constraints are comple...
详细信息
We revisit the SeqBin constraint [1]. this meta-constraint subsumes a number of important global constraints like Change [2], Smooth [3] and IncreasingNValue [4]. We show that the previously proposed filtering algorit...
详细信息
this paper presents a sweep based algorithm for the cumulative constraint, which can operate in filtering mode as well as in greedy assignment mode. Given n tasks, this algorithm has a worst-case time complexity of O(...
详细信息
the development of maritime oil wells depends on the availability of specialized fleet capable of performing the required activities. In addition, the exploitation of each well can only start when it is connected thro...
详细信息
Feature Terms are a generalization of first-order terms which have been recently received increased attention for their usefulness in structured machine learning applications. One of the main obstacles for their wide ...
详细信息
this paper introduces a constraint model and solving techniques for code generation in a compiler back-end. It contributes a new model for global register allocation that combines several advanced aspects: multiple re...
详细信息
Reasoning over bit-vectors arises in a variety of applications in verification and cryptography. this paper presents a bit-vector domain for constraintprogramming and its associated filtering algorithms. the domain s...
详细信息
the minimal label problem (MLP) (also known as the deductive closure problem) is a fundamental problem in qualitative spatial and temporal reasoning (QSTR). Given a qualitative constraint network Γ, the minimal netwo...
详细信息
Many constraint problems exhibit dominance relations which can be exploited for dramatic reductions in search space. Dominance relations are a generalization of symmetry and conditional symmetry. However, unlike symme...
详细信息
the optimal search path (OSP) problem is a single-sided detection search problem where the location and the detectability of a moving object are uncertain. A solution to this -hard problem is a path on a graph that ma...
详细信息
暂无评论