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 46 for “"Combinatorial Algorithms"”.

  1. Topics in Combinatorial Algorithms

    … importance in Computer Science. The study of algorithms includes the study of efficient data structures. This thesis deals with various aspects of combinatorial algorithms and data structures.

    uiuc Repository record for Topics in Combinatorial Algorithms (opens in a new tab)

  2. Combinatorial Algorithms in Scientific Computing

    This thesis highlighted combinatorial techniques in scientific computing as a research field full of interesting problems with real impact. From the scientific computing point of view, our results show that very significant computational savings can be achieved by employing combinatorial …

    uiuc Repository record for Combinatorial Algorithms in Scientific Computing (opens in a new tab)

  3. Combinatorial algorithms on partially ordered sets

    The main results of this dissertation are various algorithms related to partially ordered sets. The dissertation basically consists of two parts. The first part treats algorithms that generate ideals of partially ordered sets. The second part concerns the generation of partially ordered sets …

    uvic Repository record for Combinatorial algorithms on partially ordered sets (opens in a new tab)

  4. Combinatorial Algorithms for Server Allocation Problem

    … velocity is also given as input. We present new algorithms for the Euclidean bipartite matching problem, showing improvements over existing algorithms. In particular, for two point sets $A, B subset mathbb{R}^d$ with $|A| = |B| = n$ and dimension $d > 1$ being constant, we developed: …

    vt Repository record for Combinatorial Algorithms for Server Allocation Problem (opens in a new tab)

  5. Topics in combinatorics and combinatorial algorithms

    In this dissertation we investigate three topics. The first is a structural parameter for partially ordered sets (posets). The parameter that we study is the interval number of a poset, denoted by i(P) for a poset P. The interval number is related to a well-studied poset parameter, partial order …

    uiuc Repository record for Topics in combinatorics and combinatorial algorithms (opens in a new tab)

  6. Combinatorial algorithms in the approximate computing paradigm

    … incorporating approximate computing into sorting algorithms, presenting an algorithm for approximate sorting with guaranteed upper bounds. The algorithms operate under a constraint on the number of comparisons performed. The dissertation continues to explore searching algorithms, specifically …

    oklahoma-thes Repository record for Combinatorial algorithms in the approximate computing paradigm (opens in a new tab)

  7. Topics in Combinatorial Algorithms (Multicommodity Flows, Quadratic Programming)

    This thesis is a study of a wide variety of combinatorial optimization problems.

    uiuc Repository record for Topics in Combinatorial Algorithms (Multicommodity Flows, Quadratic Programming) (opens in a new tab)

  8. Combinatorial Algorithms for Submodular Function Minimization and Related Problems

    … cut problem and also contains a number of other combinatorial optimization problems as special cases. In this thesis, we study submodular function minimization and two related problems: matroid polyhedron membership and matroid intersection. A significant contribution concerns algorithms for the …

    waterloo Repository record for Combinatorial Algorithms for Submodular Function Minimization and Related Problems (opens in a new tab)

  9. The Kostant-Toda Lattice, Combinatorial Algorithms and Ultradiscrete Dynamics

    … probing of these exciting connections between algorithms, combinatorics and dynamical systems theory.

    arizona-thes Repository record for The Kostant-Toda Lattice, Combinatorial Algorithms and Ultradiscrete Dynamics (opens in a new tab)

  10. Topics in the Design and Analysis of Combinatorial Algorithms

    … presents topics in the analysis and design of Combinatorial Algorithms. The second chapter introduces a technique for obtaining more precise closed form solutions of recurrence relations defined by minimization and maximization operators. Since such recurrences arise quite frequently in the …

    uiuc Repository record for Topics in the Design and Analysis of Combinatorial Algorithms (opens in a new tab)

  11. Scalable Combinatorial Algorithms for Optimal Transport Based Similarity Metrics

    … In this document, we propose to use combinatorial methods to design scalable and noise-resistant solutions for OT. We present four key contributions in this work. First, we introduce a novel combinatorial parallel algorithm for approximating OT, which achieves a parallel time …

    vt Repository record for Scalable Combinatorial Algorithms for Optimal Transport Based Similarity Metrics (opens in a new tab)

  12. Certifying Correctness for Combinatorial Algorithms : by Using Pseudo-Boolean Reasoning

    Over the last decades, dramatic improvements in combinatorialoptimisation algorithms have significantly impacted artificialintelligence, operations research, and other areas. These advances,however, are achieved through highly sophisticated algorithms that aredifficult to verify and prone to …

    lund Repository record for Certifying Correctness for Combinatorial Algorithms : by Using Pseudo-Boolean Reasoning (opens in a new tab) Download PDF for Certifying Correctness for Combinatorial Algorithms : by Using Pseudo-Boolean Reasoning (opens in a new tab)

  13. Combinatorial Algorithms for the Active Time and Busy Time Problems

    … the busy time problem. First, we give a purely combinatorial algorithm for the active time problem which matches its best known approximation ratio (the existing algorithm is based on a rather involved LP rounding scheme). Second, we describe a local search based heuristic for the problem and …

    maryland Repository record for Combinatorial Algorithms for the Active Time and Busy Time Problems (opens in a new tab)

  14. Combinatorial algorithms for perturbation theory and application on quantum computing

    … of this dissertation is then to analyze the combinatorial structure of the perturbation theory as it is used for perturbative reductions.

    purdue-thes Repository record for Combinatorial algorithms for perturbation theory and application on quantum computing (opens in a new tab)

  15. A Separator-Based Framework for Graph Matching Problems

    … and n vertices, there are known, long-standing combinatorial algorithms that compute a maximum cardinality matching in O(m\sqrt{n}) time. For graphs with non-negative integer edge costs at most C, it is known how to compute a minimum-cost maximum cardinality matching in roughly O(m\sqrt{n} …

    vt Repository record for A Separator-Based Framework for Graph Matching Problems (opens in a new tab)

  16. From Enormous Structured Models to On-device Federated Learning: Robustness, Heterogeneity and Optimization

    … dissertation presents diagnostic methods and new algorithms to measure and improve the robustness of machine learning models to heterogeneous operating circumstances across these revolutions. Differentiable programming and end-to-end learning from examples are challenged by applications that …

    washington Repository record for From Enormous Structured Models to On-device Federated Learning: Robustness, Heterogeneity and Optimization (opens in a new tab)

  17. A Generalization of Sturmian Sequences: Combinatorial Structure and Transcendence

    … Sturmian sequences. We describe two simple combinatorial algorithms for constructing characteristic Arnoux-Rauzy sequences (one of which is new even in the Sturmian case). Arnoux-Rauzy sequences arising from fixed points of primitive morphisms are characterized by an underlying periodic …

    unt Repository record for A Generalization of Sturmian Sequences: Combinatorial Structure and Transcendence (opens in a new tab)

Page 1 of 3