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 27 for “"optimal partitioning"”.

  1. Coloring and degeneracy for determining very large and sparse derivative matrices

    … as a graph coloring problem. To find out the optimal partitioning, we have proposed a new algorithm that combines existing exact and heuristic algorithms. We have introduced degeneracy and maximum k-core for sparse matrices to solve the problem in stages. Our combined approach produce better …

    lethbridge Repository record for Coloring and degeneracy for determining very large and sparse derivative matrices (opens in a new tab)

  2. Transport-level transactions : simple consistency for complex scalable low-latency cloud applications

    … While for most applications many ideal partitioning schemes readily exist, First-Person Shooter (FPS) games and Relational Database Management Systems (RDBMS) are instances of applications whose state can’t be trivially partitioned. For any partitioning scheme there exists an FPS/RDBMS …

    ubc Repository record for Transport-level transactions : simple consistency for complex scalable low-latency cloud applications (opens in a new tab) Download PDF for Transport-level transactions : simple consistency for complex scalable low-latency cloud applications (opens in a new tab)

  3. PAMBA: Partition-aware and Multi-SLO Batching for Serverless Inference on Heterogeneous Clouds

    … the CPU–GPU gap, the system employs a customized partitioning strategy derived from latency-optimal partitioning, adapted to satisfy serverless resource constraints and jointly consider latency feasibility and per-request cost. This adaptation allows partitioned execution to emerge as an effective …

    york Repository record for PAMBA: Partition-aware and Multi-SLO Batching for Serverless Inference on Heterogeneous Clouds (opens in a new tab)

  4. Detecting changepoints in multivariate data

    … new methods PSMOP (Pruned Subset Multivariate Optimal Partitioning) and SPOT (Subset Partitioning Optimal Time) for solving this problem. PSMOP uses novel search space reduction techniques to efficiently compute an exact solution for data of moderate size. SPOT is an approximate method, which …

    lancaster Download PDF for Detecting changepoints in multivariate data (opens in a new tab)

  5. Power Grid Partitioning and Monitoring Methods for Improving Resilience

    … no operation constraint violations. The idea of optimal partitioning is further extended to the distribution network. A planning problem for determining which parts of the existing distribution grid can be converted to microgrids is formulated. This partitioning formulation addresses safety …

    vt Repository record for Power Grid Partitioning and Monitoring Methods for Improving Resilience (opens in a new tab)

  6. Item batching for picker routing in warehouses: Applying column generation with an exact, novel subproblem algorithm

    The item batching problem concerns finding an optimal partitioning of items waiting to be picked in a warehouse into batches, such that these batches can be picked with minimal total walking distance. In this project, the item batching problem is solved through column generation, an efficient …

    chalmers Repository record for Item batching for picker routing in warehouses: Applying column generation with an exact, novel subproblem algorithm (opens in a new tab)

  7. Real-time power system topology change detection and identification

    … area, allowing for even faster detection. The optimal partitioning scheme is formulated as an integer program and solved using a greedy algorithm. In the second half of the thesis, an adaptive line outage detection algorithm that accounts for the transient dynamics following a line outage is …

    uiuc Repository record for Real-time power system topology change detection and identification (opens in a new tab)

  8. FastRecover: simple and effective fault recovery in a distributed operator-based stream processing engine

    … on checkpoint overhead, FastRecover computes the optimal expected recovery time, as well as the strategy used for checkpointing and recovery in each operator. The main idea of FastRecover is to compute an optimal partitioning of the streaming operator topology into independent segments; for each …

    uiuc Repository record for FastRecover: simple and effective fault recovery in a distributed operator-based stream processing engine (opens in a new tab)

  9. Clustering Response-Stressor Relationships in Ecological Studies

    … with predetermined minimum sample size. The optimal partition/cluster is selected by Monte Carlo simulation. We propose several model selection criteria for optimal partitioning and modeling according to the nature of the study and extend it to multivariate analysis to find the underlying …

    vt Repository record for Clustering Response-Stressor Relationships in Ecological Studies (opens in a new tab)

  10. Early Dependability Analysis of FPGA-Based Space Applications Using Formal Verification

    … its design assurance level requirements, and optimal partitioning of Triple-Modular Redundant (TMR) Systems. Such analysis can also guide designers to adopt proper mitigation technique(s), such as rescheduling, TMR, TMR with less frequent scrubs, or even can help to decide the number of TMR …

    concordia Download PDF for Early Dependability Analysis of FPGA-Based Space Applications Using Formal Verification (opens in a new tab)

  11. Network configurations for seamless support of CDMA soft handoffs between cell-clusters

    … configuration. In configurations I and II, the optimal partitioning of trunk groups serving a boundary cell into direct and cross links is determined by mathematical analysis and computer simulation. For configuration IB, the optimal number of trunks required to interconnect adjacent MSCs is …

    ubc Repository record for Network configurations for seamless support of CDMA soft handoffs between cell-clusters (opens in a new tab) Download PDF for Network configurations for seamless support of CDMA soft handoffs between cell-clusters (opens in a new tab)

  12. Peptide-tagged proteins in aqueous two-phase systems

    … proteins containing peptide tags for improved partitioning in aqueous two-phase systems. Qualitatively the peptide-tagged protein partitioning could be predicted from peptide data, i.e. partitioning trends found for peptides were also found for the peptide-tagged proteins. However, full effect …

    lund Repository record for Peptide-tagged proteins in aqueous two-phase systems (opens in a new tab) Download PDF for Peptide-tagged proteins in aqueous two-phase systems (opens in a new tab)

  13. ARQ Techniques for MIMO Communication Systems

    … the forward error control code. A concept of sup-optimal partitioning of the (super-)constellation is proposed. The hybrid-ARQ error control scheme, consisting of the optimal code for each transmission, outperforms the hybrid-ARQ error control scheme, consisting of the same code for all …

    byu Repository record for ARQ Techniques for MIMO Communication Systems (opens in a new tab) Download PDF for ARQ Techniques for MIMO Communication Systems (opens in a new tab)

  14. Evaluating trait-based ecology in Sphagnum moss

    … such as resource economics theory (RET) and optimal partitioning theory (OPT), which provide clear mechanistic predictions for pattern of trait responses that reflects the life-history strategies of species. RET posits that plant traits are coordinated for fast or slow resource acquisition …

    guelph Repository record for Evaluating trait-based ecology in Sphagnum moss (opens in a new tab)

  15. Plant Biomass Allocation: Understanding the Variability within Size Constraints

    The majority of studies on plant biomass partitioning have focused on the effects of environment. Optimal Partitioning Theory (OPT) suggests that plants should allocate biomass to the organ that acquires the most limiting resource. Though, it has recently been disputed as to how much of this …

    arizona-thes Repository record for Plant Biomass Allocation: Understanding the Variability within Size Constraints (opens in a new tab)

  16. Communication and Coordination in Wireless Multimedia Sensor and Actor Networks

    … model is proposed, based on an event-driven partitioning paradigm. Sensors are partitioned into different sets and each set is associated with a different actor. Data delivery trees are created to optimally react to the event and timely deliver event data with minimum energy expenditure. The …

    gatech Repository record for Communication and Coordination in Wireless Multimedia Sensor and Actor Networks (opens in a new tab)

  17. Secure and high-performance big-data systems in the cloud

    … to all the cores and to search for the best partitioning among many possibilities, I proposed a heuristic based search strategy that achieves locally optimal partitioning with lightweight search overhead. The key idea is to use a white-box approach to search for the theoretically best …

    gatech Repository record for Secure and high-performance big-data systems in the cloud (opens in a new tab)

  18. Analysis and Implementation Considerations of Krylov Subspace Methods on Modern Heterogeneous Computing Architectures

    … runtime model can be used to identify an optimal partitioning strategy of the RHS for solving systems with many RHS. The second problem studies the s-step GMRES method, which is an implementation of GMRES that attains high performance on modern heterogeneous machines by generating s Krylov …

    temple Repository record for Analysis and Implementation Considerations of Krylov Subspace Methods on Modern Heterogeneous Computing Architectures (opens in a new tab)

  19. Dynamic Resource Allocation in Wireless Heterogeneous Networks

    … frequency reuse scheme and the centralized optimal partitioning between the macro and picos. In the second part of the dissertation, we propose a time domain solution to the interference problem. We consider the problem of maximizing the alpha-fairness utility over heterogeneous wireless …

    maryland Repository record for Dynamic Resource Allocation in Wireless Heterogeneous Networks (opens in a new tab)

  20. Analysing and levelling manufacturing complexity in mixed-model assembly lines

    … combinatorial optimization problem involving the optimal partitioning of assembly work among the workstations with a particular objective in mind. Subsequently, solving mixed-model assembly line balancing problems (MMALBPs) is much more complex than single-model cases, as workload must be smoothed …

    ghent Repository record for Analysing and levelling manufacturing complexity in mixed-model assembly lines (opens in a new tab)

Page 1 of 2