资源分类
》 资源 》论文》Reasoning with Lines in the Euclidean Space

Reasoning with Lines in the Euclidean Space

2019-11-15 | |  65 |   56 |   0

Abstract The main result of this paper is to show that the problem of instantiating a fifinite and path-consistent constraint network of lines in the Euclidean space is NP-complete. Indeed, we already know that reasoning with lines in the Euclidean space is NPhard. In order to prove that this problem is NPcomplete, we fifirst establish that a particular instance of this problem can be solved by a nondeterministic polynomial-time algorithm, and then we show that solving any fifinite and path-consistent constraint network of lines in the Euclidean space is at most as diffificult as solving that instance

上一篇：Nested Monte-Carlo Search

下一篇：Search Strategies for an Anytime Usage of the Branch and Prune Algorithm

用户评价
全部评价

热门资源

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

  • A Mathematical Mo...

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

  • Rating-Boosted La...

    The performance of a recommendation system reli...