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 2989 for “"Cuts"”.

  1. Split Cuts From Sparse Disjunctions

    … Programming (MIP) models. Various types of cuts have long been exploited by MIP solvers, leading to state-of-the-art performance in practice. Among them, the class of split cuts, which includes Gomory Mixed Integer (GMI) and Mixed Integer Rounding (MIR) cuts from tableaux, are arguably the …

    waterloo Repository record for Split Cuts From Sparse Disjunctions (opens in a new tab)

  2. Mathematical Short Cuts and Checks

    … computer naturally should be the master of short cuts and methods for checking his work. The latter is perhaps of more importance than the former because one must be able to show his employer that he knows that his work is correct.

    marquette Repository record for Mathematical Short Cuts and Checks (opens in a new tab)

  3. Computing with Multi-Row Intersection Cuts

    … Linear Programming (MIP) models. Many important cuts used in practice, such as Gomory Mixed-Integer (GMI) cuts, are obtained by solving the linear relaxation of the MIP, extracting a single row of the simplex tableau, then applying integrality arguments to it. A natural extension, which has …

    waterloo Repository record for Computing with Multi-Row Intersection Cuts (opens in a new tab)

  4. Orderings, cuts and formal power series

    … the natural valuation v on R. One can prove that cuts in a given Hahn product H might be realized by suitable elements of a certain bigger Hahn product. In this way, each cut in R, and hence each ordering on R(y) corresponds to a canonically defined element Ψ in a certain bigger formal power …

    sask Repository record for Orderings, cuts and formal power series (opens in a new tab)

  5. Nutritional Analysis of Selected Pork Loin Cuts

    … determination of composition. The pork loin cuts or roasts selected for this study were raw fresh non-enhanced center loin (chops) bone-in (CLCB; braised, pan fried), center rib (chops) bone-in (CRCB; braised, pan fried), top loin (chops) boneless (TLC; braised, pan fried), center loin roast …

    ttu Repository record for Nutritional Analysis of Selected Pork Loin Cuts (opens in a new tab)

  6. Nutrient composition of selected pork loin cuts

    … the raw and cooked composition of three cuts of pork, bone-in blade chops and roasts and baby back ribs; 2) determine the amount of separable lean, separable fat and refuse from the raw and cooked cuts; and 3) determine cooking losses and nutrient retention for the cooked products.

    ttu Repository record for Nutrient composition of selected pork loin cuts (opens in a new tab)

  7. Nutrient analysis of USDA Prime beef cuts

    … information is needed for USDA Prime beef cuts which are becoming increasingly available in the retail, wholesale and foodservice sectors. Additionally, the number of USDA Prime beef cuts represented in the USDA nutrient database is not representative of the cuts available to consumers. The …

    ttu Repository record for Nutrient analysis of USDA Prime beef cuts (opens in a new tab)

  8. Stereo matching using higher-order graph cuts

    … is the one with the lowest energy. And graph cuts is one of the efficient and effective minimization tools that avoids the problems of local minima. Conventional energy functions are defined on Markov Random Fields (MRFs) with a 4-connected grid structure derived from the image, however it is …

    anu Repository record for Stereo matching using higher-order graph cuts (opens in a new tab)

  9. Preserving large cuts in fully dynamic graphs

    … $n$) maximum degree which approximates all large cuts in $G$ with high probability.

    uvic Repository record for Preserving large cuts in fully dynamic graphs (opens in a new tab)

  10. Ranks and Partial Cuts in Forward Hypergraphs

    Many real-world relations are networks that can be modelled with a kind of directed hypergraph named a forward hypergraph (F-graph). F-graphs capture the semantics of both conjunctive and disjunctive dependency relations. Logic statements are sometimes represented using AND/OR directed graphs and …

    queens Repository record for Ranks and Partial Cuts in Forward Hypergraphs (opens in a new tab)

  11. Compassionately Conservative Normalized Cuts for Image Segmentation

    … method for segmenting images is the Normalized Cuts (NCuts) algorithm, which quantifies the cost for graph partitioning in a way that biases clusters or segments that are balanced towards having lower values than unbalanced partitionings. This bias is so strong, however, that the NCuts algorithm …

    rit Repository record for Compassionately Conservative Normalized Cuts for Image Segmentation (opens in a new tab)

  12. Cuts and partitions: solving, counting, and enumerating

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2023-12-04 without embargo terms

    uiuc Repository record for Cuts and partitions: solving, counting, and enumerating (opens in a new tab)

  13. Cuts and connectivity in graphs and hypergraphs

    … - We present several results on hypergraph cuts, including (a) a near linear time algorithm for finding a (2+epsilon)-approximate min-cut, (b) an algorithm to find a representation of all min-cuts in the same time as finding a single min-cut, (c) a sparse subgraph that preserves connectivity …

    uiuc Repository record for Cuts and connectivity in graphs and hypergraphs (opens in a new tab)

  14. Tender cuts of three grades of beef

    Thesis (M.A.)--Michigan State College of Agriculture and Applied Science. Dept. of Institution Administration, 1955

    msu Repository record for Tender cuts of three grades of beef (opens in a new tab)

Page 1 of 150