We first present a generic pruning technique which aggregates several constraints sharing some variables. the method is derived from an idea called sweep which is extensively used in computational geometry. A first be...
详细信息
Symmetries in constraint satisfaction or combinatorial optimization problems can cause considerable difficulties for exact solvers. One way to overcome the problem is to employ sophisticated models with no or at least...
详细信息
In interactive graphical applications we often require that objects do not overlap. Such non-overlap constraints can be modelled as disjunctions of arithmetic inequalities. Unfortunately, disjunctions are typically no...
详细信息
Machine systems for understanding hand-drawn sketches must reliably interpret common but sloppy curvilinear configurations. the task is commonly expressed as finding an image model in the image data, but few approache...
详细信息
In distributed resource allocation a set of agents must assign their resources to a set of tasks. this problem arises in many real-world domains such as disaster rescue, hospital scheduling and the domain described in...
详细信息
Instruction scheduling is one of the most important steps for improving the performance of object code produced by a compiler. the local instruction scheduling problem is to find a minimum length instruction schedule ...
详细信息
the necessity of non-binary constraint satisfaction algorithms is increasing because many real problems are inherently non-binary. Considering overconstrained problems (and Partial Forward Checking as the solving algo...
详细信息
constraintprogramming (CP) is a very general programming paradigm that proved its efficiency on solving complex industrial problems. Most real-life problems are stochastic in nature, which is usually taken into accou...
详细信息
We show that existing constraint manipulation technology incorporated in the paradigm of symbolic model checking with rich assertional languages [KMM+97], can be successfully applied to the verification of client-serv...
详细信息
In recent years, many works have been carried out to solve over-constrained problems, and more specifically the Maximal constraint Satisfaction Problem (Max-CSP), where the goal is to minimize the number of constraint...
详细信息
暂无评论