资源分类
》 资源 》论文》estimating the size of search trees by sampling with domain knowledge

estimating the size of search trees by sampling with domain knowledge

2019-10-31 | |  47 |   37 |   0
Abstract We show how recently-defined abstract models of the Branch & Bound algorithm can be used to obtain information on how the nodes are distributed in B&B search trees. This can be directly exploited in the form of probabilities in a sampling algorithm given by Knuth that estimates the size of a search tree. This method reduces the offline estimation error by a factor of two on search trees from MixedInteger Programming instances.

上一篇：optimal escape interdiction on transportation networks

下一篇：multi instance learning with key instance shift

用户评价
全部评价

热门资源

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