资源分类
》 资源 》论文》A Generalized Arc-Consistency Algorithm for a Class of Counting Constraints

A Generalized Arc-Consistency Algorithm for a Class of Counting Constraints

2019-11-12 | |  37 |   39 |   0
Abstract This paper introduces the SEQ BIN meta-constraint with a polytime algorithm achieving generalized arc-consistency. SEQ BIN can be used for encoding counting constraints such as C HANGE, S MOOTH, or I NCREASING N VALUE. For all of them the time and space complexity is linear in the sum of domain sizes, which improves or equals the best known results of the literature.

上一篇：Finite-Length Markov Processes with Constraints

下一篇：Nested Rollout Policy Adaptation for Monte Carlo Tree Search

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

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