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 272 for “"Matching problem"”.

  1. DYNAMIC RIDESHARE OPTIMIZED MATCHING PROBLEM

    … develops a Dynamic Rideshare Optimized Matching (DROM) model and solution that is aimed at identifying suitable matches between passengers requesting rideshare services with appropriate drivers available to carpool for credits and HOV lane privileges. DROM receives passengers and …

    maryland Repository record for DYNAMIC RIDESHARE OPTIMIZED MATCHING PROBLEM (opens in a new tab)

  2. The travelling wave tube wave guide matching problem

    Among the interesting projects under research and development at the Sylvania Electric Research Laboratories is that of the traveling wave tube amplifier. This work is being undertaken at the Flushing Laboratories in New York in accordance with Navy Contract No. NObsr39160 dated, 20 June 1947.

    nps Repository record for The travelling wave tube wave guide matching problem (opens in a new tab)

  3. Robust Exact Algorithms for the Euclidean Bipartite Matching Problem

    The minimum cost bipartite matching problem is a well-studied optimization problem in computer science and operations research, with wide-ranging applications in fields such as machine learning, economics, transportation, logistics and biology. A special instance of this problem is the computation …

    vt Repository record for Robust Exact Algorithms for the Euclidean Bipartite Matching Problem (opens in a new tab)

  4. Extending Theories of the Graph Matching Problem and Its Variants

    … on graphs a crucial task. A fundamental problem in this domain is the graph matching problem, which seeks to align node labels across graphs while minimizing structural and feature discrepancies. In this thesis, I investigate algorithms for the graph matching problem and one of its key …

    maryland Repository record for Extending Theories of the Graph Matching Problem and Its Variants (opens in a new tab)

  5. Understanding the importance of side information in graph matching problem

    Graph matching algorithms rely on the availability of seed vertex pairs as side information to deanonymize users across networks. Although such algorithms work well in practice, there are other types of side information available which are potentially useful to an attacker. In this thesis, we …

    uiuc Repository record for Understanding the importance of side information in graph matching problem (opens in a new tab)

  6. Matchings with a size constraint

    We study the matching problem and some variants such as b-matching and (g, f)-factors. This thesis aims at polynomial algorithms which in addition have other properties. In particular, we develop a polynomial algorithm which can find optimal solutions of each possible size for weighted matching …

    ubc Repository record for Matchings with a size constraint (opens in a new tab) Download PDF for Matchings with a size constraint (opens in a new tab)

  7. Randomized Approximation for the Matching and Vertex Cover Problem in Hypergraphs: Complexity and Algorithms

    … algorithms for the hitting set and b-matching problems in hypergraphs. We present a randomized algorithm for the hitting set problem based on linear programming. The analysis of the randomized algorithm rests upon the probabilistic method, more precisely on some concentration …

    cau-kiel Repository record for Randomized Approximation for the Matching and Vertex Cover Problem in Hypergraphs: Complexity and Algorithms (opens in a new tab)

  8. The Complexity of Extended Formulations

    … approach to solve combinatorial optimization problems: if one can find a concise geometric description of the possible solutions to a problem then one can use convex optimization to solve the problem quickly. Many combinatorial optimization problems have a natural symmetry. In this work we …

    gatech Repository record for The Complexity of Extended Formulations (opens in a new tab)

  9. A PSO based load-rebalance algorithm for task-matching in large scale heterogeneous computing systems

    … to various real world NP complete optimization problems has been extensively explored by researchers. One such problem is the task matching problem in large heterogeneous distributed computing environments like Grids and Clouds. Researchers have explored Particle Swarm Optimization(PSO), which …

    manitoba Repository record for A PSO based load-rebalance algorithm for task-matching in large scale heterogeneous computing systems (opens in a new tab)

  10. Online Decision-Making in a Randomized Environment: Stochastic Matching and Adaptive Random Graph Processes

    … we consider an online version of the stochastic matching problem. The stochastic matching problem is a generalization of the classical maximal matching problem in which the edges are associated with known edge probabilities which model their likelihood of existing. The algorithm must probe …

    toronto-retro Repository record for Online Decision-Making in a Randomized Environment: Stochastic Matching and Adaptive Random Graph Processes (opens in a new tab)

  11. Matchings in Geometric Graphs

    … edge set contains straight-line segments. A matching in a graph is a subset of edges of the graph with no shared vertices. A matching is called perfect if it matches all the vertices of the underling graph. A geometric matching is a matching in a geometric graph. In this thesis, we study …

    carleton Repository record for Matchings in Geometric Graphs (opens in a new tab)

  12. On the nonnegative least squares

    … method for solving linear programming problems. In particular, we investigate connections between this primal-dual method and the classical Hungarian method for the assignment problem. Firstly, we devise a fast procedure for computing the unrestricted least squares solution of a …

    gatech Repository record for On the nonnegative least squares (opens in a new tab)

  13. A Geometric Approach to Pattern Matching in Polyphonic Music

    The music pattern matching problem involves finding matches of a small fragment of music called the "pattern" into a larger body of music called the "score". We represent music as a series of horizontal line segments in the plane, and reformulate the problem as finding the best translation of a …

    waterloo Repository record for A Geometric Approach to Pattern Matching in Polyphonic Music (opens in a new tab)

  14. Genetic learning particle swarm optimization for task matching in grid environment

    … of the applications. One of the fundamental problem computing with the Grid system is assigning tasks of various users to the resources efficiently such that the execution time of the application is minimized while Grid resources are utilized optimally. This is called the task matching …

    manitoba Repository record for Genetic learning particle swarm optimization for task matching in grid environment (opens in a new tab)

  15. Variations of online bipartite matching

    The Online Bipartite Matching Problem is a well-studied problem in theoretical computer science that models several real-world applications including online investment, kidney transplantation, aviation security passenger screening, and enhanced Ebola entry screening. However, the original version …

    uiuc Repository record for Variations of online bipartite matching (opens in a new tab)

  16. Probabilistic matching of solid shapes in arbitrary dimension

    … the similarity between objects is a fundamental problem in computer vision and pattern recognition, but also in other fields of computer science. This thesis concentrates on the matching problem, which has received a lot of attention in Computational Geometry. Given a class of shapes S, a set of …

    fu-berlin Repository record for Probabilistic matching of solid shapes in arbitrary dimension (opens in a new tab)

Page 1 of 14