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 7 of 7 for “"combinatorial generation"”.

  1. Coroutine-based combinatorial generation

    The two well-known approaches to designing combinatorial generation algorithms are the recursive approach and the iterative approach. In this thesis a third design approach using coroutines, introduced by Knuth and Ruskey, is explored further. An introduction to coroutines and their implementation …

    uvic Repository record for Coroutine-based combinatorial generation (opens in a new tab)

  2. Global Metabolomics-Based Identification Of Small-Molecule Signals That Regulate Development In Nematodes

    … this dissertation, provide striking examples for combinatorial generation of structural diversity in nematodes and connect primary metabolism to regulation of development and adult phenotypic plasticity. Further the author used comparative metabolomics to investigate ascaroside biogenesis in C. …

    cornell Repository record for Global Metabolomics-Based Identification Of Small-Molecule Signals That Regulate Development In Nematodes (opens in a new tab)

  3. Recursive optimization: exact and efficient combinatorial optimization algorithm design principles with applications to machine learning

    … a generic algorithm design framework for solving combinatorial optimization problems, it subsumes the classical recursive optimization methods, such as greedy, dynamic programming, divide-and-conquer, and branch-and-bound (BnB) methods. In particular, this thesis focuses on solving combinatorial …

    birmingham Download PDF for Recursive optimization: exact and efficient combinatorial optimization algorithm design principles with applications to machine learning (opens in a new tab)

  4. Lace tessellations: a mathematical model for bobbin lace and an exhaustive combinatorial search for patterns

    … of symmetry. We demonstrate, by computational generation, that there are lace ground representatives from each of the 17 planar periodic symmetry groups.

    uvic Repository record for Lace tessellations: a mathematical model for bobbin lace and an exhaustive combinatorial search for patterns (opens in a new tab)

  5. Monomino-Domino Tatami Coverings

    We present several new results on the combinatorial properties of a locally restricted version of monomino-domino coverings of rectilinear regions. These are monomino-domino tatami coverings, and the restriction is that no four tiles may meet at any point. The global structure that the tatami …

    uvic Repository record for Monomino-Domino Tatami Coverings (opens in a new tab)

  6. Graph Distinguishability and the Generation of Non-Isomorphic Labellings

    A distinguishing colouring of a graph G is a labelling of the vertices of G with colours such that no non-trivial automorphism of G preserves all colours. The distinguishing number of G is the minimum number of colours in a distinguishing colouring. This thesis presents a survey of the history of …

    uvic Repository record for Graph Distinguishability and the Generation of Non-Isomorphic Labellings (opens in a new tab)

  7. Shift gray codes

    Combinatorial objects can be represented by strings, such as 21534 for the permutation (1 2) (3 5 4), or 110100 for the binary tree corresponding to the balanced parentheses (()()). Given a string s = s1 s2 sn, the right-shift operation shift(s, i, j) replaces the substring si si+1..sj by si+1..sj …

    uvic Repository record for Shift gray codes (opens in a new tab)