资源分类
》 资源 》论文》Compact-MDD: Efficiently Filtering (s)MDD Constraints with Reversible Sparse Bit-sets

Compact-MDD: Efficiently Filtering (s)MDD Constraints with Reversible Sparse Bit-sets

2019-11-05 | |  56 |   41 |   0
Abstract Multi-Valued Decision Diagrams (MDDs) are instrumental in modeling combinatorial problems with Constraint Programming. In this paper, we propose a related data structure called sMDD (semi-MDD) where the central layer of the diagrams is non-deterministic. We show that it is easy and efficient to transform any table (set of tuples) into an sMDD. We also introduce a new filtering algorithm, called Compact-MDD, which is based on bitwise operations, and can be applied to both MDDs and sMDDs. Our experimental results show the practical interest of our approach.

上一篇：Stratification for Constraint-Based Multi-Objective Combinatorial Optimization

下一篇：A Reactive Strategy for High-Level Consistency During Search

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...