Benzenoids are a subfamily of hydrocarbons (molecules that are only made of hydrogen and carbon atoms) whose carbon atoms form hexagons. these molecules are widely studied in theoretical chemistry. then, there is a lo...
详细信息
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 describes a filtering algorithm for a type of constraintthat often arises in rostering problems but that also has wider application. Defined on a sequence of variables, the stretch constraint restricts the...
详细信息
Arc consistency plays a central role in solving constraint Satisfaction Problems. this is the reason why many algorithms have been proposed to establish it. Recently, an algorithm called AC2001 and AC3.1 has been inde...
详细信息
Bounded Max-Sum is a message-passing algorithm for solving Distributed constraint Optimization Problems able to compute solutions with a guaranteed approximation ratio. Although its approximate solutions were empirica...
详细信息
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...
详细信息
In this paper, we present a domain specific optimization framework based on a concurrent model-based approach for handling the complete problem of mapping a DSP application on a parallel architecture. the implementati...
详细信息
How to synthesize molecules is a fundamental and well studied problem in chemistry. However, computer aided methods are still under-utilized in chemical synthesis planning. Given a specific chemistry (a set of chemica...
详细信息
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...
详细信息
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...
详细信息
暂无评论