资源分类
》 资源 》论文》Optimally Efficient Bidirectional Search

Optimally Efficient Bidirectional Search

2019-10-10 | |  65 |   39 |   0
Abstract A? is optimally efficient with regard to node expansions among unidirectional admissible algorithms—those that only assume that the heuristic used is admissible. This paper studies algorithms that are optimally efficient for bidirectional search algorithms. We present the Fractional MM algorithm and its sibling, the MT algorithm, which is simpler to analyze. We then develop variants of these algorithms that are optimally efficient, each under different assumptions on the information available to the algorithm

上一篇：On Constrained Open-World Probabilistic Databases

下一篇：PI-Bully: Personalized Cyberbullying Detection with Peer Influence

用户评价
全部评价

热门资源

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

  • Learning to learn...

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

  • A Mathematical Mo...

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