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 20 of 3802 for “"packing"”.

  1. Packing Unit Disks

    Given a set of unit disks in the plane with union area A, what fraction of A can be covered by selecting a pairwise disjoint subset of the disks? Richard Rado conjectured 1/4 and proved 1/4.41. In this thesis, we consider a variant of this problem where the disjointness constraint is relaxed: …

    waterloo Repository record for Packing Unit Disks (opens in a new tab)

  2. Packing Directed Joins

    … that the maximum number of directed joins in a packing is equal to the minimum weight of a directed cut, for any weighted directed graph. This is a generalization of Woodall's Conjecture (which is still open). Schrijver found the first known counterexample to the Edmonds-Giles Conjecture, while …

    waterloo Repository record for Packing Directed Joins (opens in a new tab)

  3. Moldable Items Packing Optimization

    … mathematical models to optimize the problem of packing a hybrid mix of rigid and moldable items within a three-dimensional volume. These two developed packing models characterize moldable items from two perspectives: (1) when limited discrete configurations represent the moldable items and (2) …

    utk-theses Repository record for Moldable Items Packing Optimization (opens in a new tab)

  4. Deformation-Driven Element Packing

    A packing is an arrangement of geometric elements within a container region in the plane. Elements are united to communicate the overall container shape, but each is large enough to be appreciated individually. Creating a packing is challenging since an artist should arrange compatible elements so …

    waterloo Repository record for Deformation-Driven Element Packing (opens in a new tab)

  5. Packing: An Architect's Guide

    A study of packing constructs a critique of the everyday: a dialogue between chaos and order, surface and area, interior and exterior, gravity and lightness. In search of tangible expression of the spatial processes I am responsible for, I have become both master architect and expert packer. I have …

    waterloo Repository record for Packing: An Architect's Guide (opens in a new tab)

  6. Packing and Counting Permutations

    … aspects of permutation classes: enumeration and packing. <br></br><br></br> Our work on enumeration consists of two campaigns. First, we enumerate all juxtaposition classes of the form “Av(abc) next to Av(xy)”, where abc and xy are permutations of lengths three and two, respectively. We represent …

    the-open-u Download PDF for Packing and Counting Permutations (opens in a new tab)

  7. Generalized Bin Packing Problems

    Packing problems make up a fundamental topic of combinatorial optimization. Their importance is confirmed both by their wide range of scientific and technological applications they are able to address and by their theoretical implications. In fact, they are exploited in many fields such as computer …

    poli-torino Repository record for Generalized Bin Packing Problems (opens in a new tab)

  8. On Discrete Hyperbox Packing

    Bin packing is a very important and popular research area in the computer science field. Past work showed many good and real-world packing algorithms. How- ever, due to the complexity of the problem in multiple-dimensional bin packing, also called hyperbox packing, we need more practical packing …

    tamu Repository record for On Discrete Hyperbox Packing (opens in a new tab)

  9. Scheduling and Packing Problems

    Scheduling and packing problems are among the most studied in theoretical computer science. This is, in part, due to their high amount of practical applications, but also because they are interesting from a theoretical point of view: Most of these problems are NP-hard, so we cannot expect to solve …

    cau-kiel Repository record for Scheduling and Packing Problems (opens in a new tab)

  10. Combinatorial Bin Packing Problems

    … behavior of what we call combinatorial bin packing problems. A combinatorial bin packing problem consists of a number of items of various sizes and value ratios (value per unit of size) along with a collection of bins of fixed capacity into which the items are to be packed. The packing must …

    arizona-thes Repository record for Combinatorial Bin Packing Problems (opens in a new tab)

  11. Generalized Branching in Circle Packing

    <p>Circle packings are configurations of circle with prescribed patterns of tangency. They relate to a surprisingly diverse array of topics. Connections to Riemann surfaces, Apollonian packings, random walks, Brownian motion, and many other topics have been discovered. Of these none has garnered …

    utk-theses Repository record for Generalized Branching in Circle Packing (opens in a new tab)

  12. Structured packing in air distillation

    … when it is advantageous to use structured packing in air separation plant. A model of a low pressure cycle was developed to calculate the power saved when packing is used, and cost models were developed for the columns and cold box. The rate of return was calculated on the extra investment …

    aston Download PDF for Structured packing in air distillation (opens in a new tab)

  13. Broadcast independence and broadcast packing

    … no broadcasting vertex hears another vertex. A packing broadcast is a broadcast where no vertex hears more than one vertex. The broadcast independence number, respectively the broadcast packing number, is the maximum weight over all independent broadcasts, respectively packing broadcasts, on G. …

    uvic Repository record for Broadcast independence and broadcast packing (opens in a new tab)

  14. Packing and embedding large subgraphs

    … a single Hamilton cycle our result concerns packing more general families of graphs into a fixed host graph. Rather than pack a small number of Hamilton cycles into a fixed host graph, our aim is to achieve optimally sized packings of more general families of graphs. More specifically, we …

    birmingham Download PDF for Packing and embedding large subgraphs (opens in a new tab)

Page 1 of 191