Now showing items 1-1 of 1

  • Scalable and Fault Tolerant Hierarchical B&B Algorithm for Computational Grids 

    Bendjoudi, Ahcène
    In : Thèses de Doctorat, (Université de Béjaïa, 2012-06-07)
    Solving to optimality large instances of combinatorial optimization problems using Branch and Bound (B&B) algorithms requires a huge amount of computing resources. Nowadays, such power is provided by large scale environments such as computational grids. However, grids induce new challenges: scalability, heterogeneity, ...

Tous les documents dans CERIST DIGITAL LIBRARY sont protégés par copyright, avec tous droits réservés. copyright © 2013-2015  CERIST
Powered by 
@mire NV