资源分类
》 资源 》论文》Distributed Constraint Optimization Problems Related with Soft Arc Consistency

Distributed Constraint Optimization Problems Related with Soft Arc Consistency

2019-11-12 | |  66 |   62 |   0

Abstract

Distributed Constraint Optimization Problems (DCOPs)can be optimally solved by distributed search algorithms,such as ADOPT and BnB-ADOPT. In centralized solv-ing, maintaining soft arc consistency during search has proved to be beneficial for performance. In this thesis we aim to explore the maintenance of different levels of soft arc consistency in distributed search when solving DCOPs.


上一篇：Belief Revision on Computation Tree Logic

下一篇：A Trust and Reputation Model for Supply Chain Management Yasaman Haghpanah

用户评价
全部评价

热门资源

  • 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...