资源分类
》 资源 》论文》Efficient Algorithms And Representations For Chance-constrained Mixed Constraint Programming

Efficient Algorithms And Representations For Chance-constrained Mixed Constraint Programming

2019-10-29 | |  59 |   37 |   0
Abstract Resistance to autonomous systems comes in part from the perceived unreliability of the systems. Concerns can be addressed by guarantees of the probability of success. This is achieved in chanceconstrained constraint programming (CC-CP) by imposing constraints required for success, and providing upper-bounds on the probability of violating constraints. This extended abstract reports on novel uncertainty representations to address problems prevalent in current methods

上一篇：Curriculum Learning in Reinforcement Learning

下一篇：Evaluating Epistemic Negation in Answer Set Programming (Extended Abstract)?

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • Learning to learn...

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

  • A Mathematical Mo...

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

  • Learning to Predi...

    Much of model-based reinforcement learning invo...