Supervisory authorities

CNRS Dauphine PSL *

Search





Home

14 September 2017: One event

séminaire

  • Séminaires du Pôle 3 : "Sciences des données"

    Thursday 14 September 14:00-15:00 - Pierre Le Bodic - Monash University (Melbourne)

    séminaire de Pierre Le Bodic

    Résumé : Title
    Estimating the Size of Search Trees by Sampling with Domain Knowledge
    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 Mixed-Integer Programming instances.
    https://www.ijcai.org/proceedings/2017/0067.pdf

    Lieu : A707

    En savoir plus : Séminaires du Pôle 3 : "Sciences des données"