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 “"ideal orientation"”.

  1. Algorithms for flows and disjoint paths in planar graphs

    … algorithms and a hardness result for the ideal orientation problem. We show that the problem is NP-hard in planar graphs. On the other hand, we show that the problem is polynomial-time solvable in planar graphs when the number of terminals is fixed, the terminals are all on the same face, …

    uiuc Repository record for Algorithms for flows and disjoint paths in planar graphs (opens in a new tab)

  2. Assembly Sequence Optimization and Assembly Path Planning

    … passive assembly), an assembler should know the ideal orientation of each component and the order in which to put the parts together (or, assembly sequence). A heuristic is presented to find the optimal assembly sequence and prescribe the orientation of the components for a minimum set of …

    vt Repository record for Assembly Sequence Optimization and Assembly Path Planning (opens in a new tab)

  3. Analogy for Appalachia

    What follows is a relatively concise attempt at ordering a series of abstracted and formalized vernacular elements within a cohesive whole. A lodge and series of cabins located in Pulaski, Virginia are used as a vehicle for pursuing this exploration.

    vt Repository record for Analogy for Appalachia (opens in a new tab)