Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"Vector packing"”.

  1. Efficient derandomization of the Lovász Local Lemma and applications to coloring and packing problems

    … Local Lemma (LLL) to deal with the following two packing type problems: (i) a particular kind of hypergraph coloring problem, and (ii) vector packing problem. The hypergraph coloring problem is connected to the resource constrained scheduling problem and vector packing is a particular …

    cau-kiel Repository record for Efficient derandomization of the Lovász Local Lemma and applications to coloring and packing problems (opens in a new tab)

  2. Data allocation in disk arrays with multiple raid levels

    … VDs allocations on physical disks using vector-packing heuristics, with disk capacity and bandwidth as the two dimensions are shown to be the best. An allocation is acceptable if it does riot exceed the disk capacity and overload disks even in the presence of disk failures. When disk …

    njit Repository record for Data allocation in disk arrays with multiple raid levels (opens in a new tab)

  3. Approximation algorithms for multidimensional bin packing

    The bin packing problem has been the corner stone of approximation algorithms and has been extensively studied starting from the early seventies. In the classical bin packing problem, we are given a list of real numbers in the range (0, 1], the goal is to place them in a minimum number of bins so …

    gatech Repository record for Approximation algorithms for multidimensional bin packing (opens in a new tab)