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 607 for “"Theory and Algorithms"”.

  1. Theory and Algorithms for Systems Optimization

    … four sets of contributions in the field of theory and algorithms for system optimization. In the first set, we introduce a simulation optimization method for redistributing bikes in a free-floating bike sharing system. The second set of contributions is a framework for batching queries in …

    usf Repository record for Theory and Algorithms for Systems Optimization (opens in a new tab)

  2. Robust Reinforcement Learning: Theory and Algorithms

    This research dissertation explores novel algorithms in the field of robust reinforcement learning (RL) that address the challenges of controlling dynamical systems in real-world scenarios. Classical reinforcement learning is a powerful sub-field in machine learning for training intelligent …

    tamu Repository record for Robust Reinforcement Learning: Theory and Algorithms (opens in a new tab)

  3. Optical control plane: theory and algorithms

    … information exchange. We study the routing and wavelength assignment problem for the special communication pattern of non-blocking all-to-all broadcast in WDM optical networks. We provide efficient solutions to reduce the number of wavelengths needed for non-blocking all-to-all broadcast, in …

    lsu-thes Repository record for Optical control plane: theory and algorithms (opens in a new tab)

  4. Theory and algorithms for spatial transcriptomics denoising

    … in a tissue, which offer the prospect of understanding cell signaling. Recent breakthroughs in spatial transcriptomics have drastically increased the area of tissue which can be profiled. However, sequencing all RNA molecules over large spatial areas is prohibitively expensive. One would like to …

    ubc Repository record for Theory and algorithms for spatial transcriptomics denoising (opens in a new tab) Download PDF for Theory and algorithms for spatial transcriptomics denoising (opens in a new tab)

  5. Theory and algorithms for swept manifold intersections

    … aided geometric design, geometric modeling, and computational topology have generated a spate of interest towards geometric objects called swept volumes. Besides their great applicability in various practical areas, the mere geometry and topology of these entities make them a perfect testbed …

    njit Repository record for Theory and algorithms for swept manifold intersections (opens in a new tab)

  6. Theory and algorithms for w-stable ideals

    … of the ideal. In [1], Francisco, Mermin, and Schweig develop formulas for the Hilbert series and Betti numbers of strongly stable ideals in terms of their Borel generators. In this thesis, a specialization of strongly stable ideals is presented which further restricts the subset of …

    colostate Repository record for Theory and algorithms for w-stable ideals (opens in a new tab)

  7. Theory And Algorithms For Structured Nonsmooth Optimization

    … in optimization is typically highly structured, and this structure is fundamental to any understanding of many concrete settings. This dissertation, consisting of two core chapters (followed by some further developments), studies structured nonsmooth optimization from both theoretical and …

    cornell Repository record for Theory And Algorithms For Structured Nonsmooth Optimization (opens in a new tab)

  8. Theory and algorithms for matching problems under preferences

    … criteria such as stability, popularity, and Pareto-optimality, etc. Each agent expresses ordinal preferences over a subset of the others. Real-life applications include assigning graduating medical students to hospitals, high school students to colleges, public houses to applicants, and …

    texas Repository record for Theory and algorithms for matching problems under preferences (opens in a new tab)

  9. Optimisation Problems with Sparsity Terms: Theory and Algorithms

    … become increasingly popular in the realm of standard nonlinear programming. In contrast to the more well-known Karush-Kuhn-Tucker condition, they are genuine optimality conditions in the sense that every local minimiser satisfies these conditions without any further assumption. Lately they have …

    wurz-thes Repository record for Optimisation Problems with Sparsity Terms: Theory and Algorithms (opens in a new tab)

  10. Theory and algorithms for finding optimal regression designs

    … properties of optimal regression designs and develop several numerical algorithms for computing them. The results can be applied to linear, nonlinear and generalized linear models. Our work starts from how to solve the design problems for A-, As, c-, I- and L-optimality criteria on …

    uvic Repository record for Theory and algorithms for finding optimal regression designs (opens in a new tab)

  11. Modeling data by multiple subspaces: theory and algorithms.

    … It arises, for example, in object tracking and structure from motion. One of the simplest methods for such modeling is based on energy minimization, where the energy involves p-th powers of distances of data points from subspaces. We first analyze under certain assumptions (e.g., spherically …

    umn Repository record for Modeling data by multiple subspaces: theory and algorithms. (opens in a new tab)

  12. Theory and algorithms for efficient physically-based illumination

    … is produced by non-pointlike area light sources and distant illumination described by environment maps. We describe novel theory and algorithms for physically-based lighting computations, and expose the design choices and tradeoffs on which the techniques are based. Two publications included in …

    aalto Repository record for Theory and algorithms for efficient physically-based illumination (opens in a new tab)

  13. Efficient and principled robot learning: Theory and algorithms

    … robots must reason about sequential decisions and their consequences in face of uncertainty. As a result, in practice, the engineering effort required to build reliable robotic systems is both demanding and expensive. This research aims to provide a set of techniques for efficient and …

    gatech Repository record for Efficient and principled robot learning: Theory and algorithms (opens in a new tab)

  14. Theory and Algorithms for Nonconvex Learning and Optimization

    … methods based on a Wasserstein fairness measure; and (iii) second-order conic and polyhedral approximations of the exponential cone. Fair classification aims to mitigate systematic disparities across protected groups in predictive decision-making. Although many widely used group fairness measures …

    gatech Repository record for Theory and Algorithms for Nonconvex Learning and Optimization (opens in a new tab)

  15. Mathematical Theory and Algorithms for Scence Semantics in Robotics

    … they require a robust, human-level understanding of scenes. This thesis introduces a unified mathematical framework and a set of algorithms for representing, fusing, and exploiting scene semantics in robotics. We first formalize semantic observations as partial interpretations of a …

    penn Repository record for Mathematical Theory and Algorithms for Scence Semantics in Robotics (opens in a new tab)

  16. Characterizing Structurally Cohesive Clusters in Networks: Theory and Algorithms

    … aims at developing generalized network models and solution approaches for studying cluster detection problems that typically arise in networks. More specifically, we consider graph theoretic relaxations of clique as models for characterizing structurally cohesive and robust subgroups, …

    tamu Repository record for Characterizing Structurally Cohesive Clusters in Networks: Theory and Algorithms (opens in a new tab)

Page 1 of 31