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 14 of 14 for “"Combinatorial optimization algorithms"”.

  1. Performant combinatorial optimization algorithms through lattice linear predicates

    Parallel algorithms for combinatorial optimization—shortest paths, min- imum spanning trees, matching, scheduling—are typically specialized to each problem, with dedicated synchronization patterns, data structures, and tuning. We explore Lattice-Linear Predicates (LLP) as an abstraction to …

    texas Repository record for Performant combinatorial optimization algorithms through lattice linear predicates (opens in a new tab)

  2. QUANTUM COMBINATORIAL OPTIMIZATION ALGORITHMS FOR PACKING PROBLEMS IN CLASSICAL COMPUTING AND NETWORKING

    … more and more relevant for complex real-world combinatorial optimization tasks. This thesis is about applications of quantum combinatorial optimization algorithms in classical computer engineering problems. These include novel quantum computing techniques that respect the constraints of …

    maryland Repository record for QUANTUM COMBINATORIAL OPTIMIZATION ALGORITHMS FOR PACKING PROBLEMS IN CLASSICAL COMPUTING AND NETWORKING (opens in a new tab)

  3. Combinatorial Optimization Algorithms for Hypergraph Matching with Application to Posture Identification in Embryonic Caenorhabditis elegans

    … modeling. This thesis addresses a gap in combinatorial optimization literature by enhancing leading methods in both graph matching and multiple object tracking (MOT) to more flexibly use data-driven point-set matching models. Presented contributions are inspired by Caenorhabditis elegans, …

    maryland Repository record for Combinatorial Optimization Algorithms for Hypergraph Matching with Application to Posture Identification in Embryonic Caenorhabditis elegans (opens in a new tab)

  4. Recursive optimization: exact and efficient combinatorial optimization algorithm design principles with applications to machine learning

    … a generic algorithm design framework for solving combinatorial optimization problems, it subsumes the classical recursive optimization methods, such as greedy, dynamic programming, divide-and-conquer, and branch-and-bound (BnB) methods. In particular, this thesis focuses on solving combinatorial …

    birmingham Download PDF for Recursive optimization: exact and efficient combinatorial optimization algorithm design principles with applications to machine learning (opens in a new tab)

  5. MRF Stereo Matching with Statistical Estimation of Parameters

    … in computer vision has been treated as a combinatorial optimization problem. Assuming that the points in stereo images form a Markov Random Field (MRF), a variety of combinatorial optimization algorithms has been developed to optimize their underlying cost functions. In many of these …

    utk-theses Repository record for MRF Stereo Matching with Statistical Estimation of Parameters (opens in a new tab)

  6. Discrete optimization problems in geometric mesh processing

    … graphics reduce geometric problems to numerical optimization problems by minimizing an energy that captures the geometric properties we seek. These methods often encounter challenges in the presence of complex global geometric constraints that cannot be easily expressed as numerical …

    ubc Repository record for Discrete optimization problems in geometric mesh processing (opens in a new tab) Download PDF for Discrete optimization problems in geometric mesh processing (opens in a new tab)

  7. Συνδυαστική θεωρία σχεδιασμών, κωδίκων και κρυπτογραφίας

    My Ph.D. Thesis involves the study of combinatorial constructions for several classes of combinatorial designs and the development of relevant algorithms that are applicable to the fields of Coding Theory and Cryptography. In the first part of the Thesis, entitled ``Combinatorial Design Theory'', …

    greece Repository record for Συνδυαστική θεωρία σχεδιασμών, κωδίκων και κρυπτογραφίας (opens in a new tab)

  8. Scalable Methods For Monte Carlo Tree Search

    … significant promise when applied to NP-hard combinatorial optimization problems, which are central to many industrial and research applications. These include problems such as the Job-Shop Schedul- ing Problem (JSSP) and the Weighted Set-Cover Problem (WSCP), both of which require intelligent …

    wayne-thes Repository record for Scalable Methods For Monte Carlo Tree Search (opens in a new tab)

  9. Resource constrained shortest paths and extensions

    … in many decomposition schemes for difficult optimization problems. We begin with a study of the RCSPP polytope for the single resource case and obtain several new valid inequality classes. Separation routines are provided, along with a polynomial time algorithm for constructing an auxiliary …

    gatech Repository record for Resource constrained shortest paths and extensions (opens in a new tab)

  10. Performance understanding and tuning of iterative computation using profiling techniques

    … underlying application. Many high performance combinatorial optimization applications involve SAT solving. A variety of SAT solvers have been developed that employ different data structures and different propagation methods for converging on a fixed point for generating a satisfiable solution. …

    gatech Repository record for Performance understanding and tuning of iterative computation using profiling techniques (opens in a new tab)

  11. Αλγόριθμοι αναπαράστασης και επίλυσης σύνθετων και μεγάλης κλίμακας προβλημάτων συνδυαστικής βελτιστοποίησης: εφαρμογή στο πρόβλημα δρομολόγησης στόλου οχημλατων και στην ανάπτυξη συστημάτων εφοδιαστικής αλυσίδας

    Η συγκεκριμένη διδακτορική διατριβή ασχολείται με την ανάπτυξη αλγορίθμων αναπαράστασης και επίλυσης του Προβλήματος Δρομολόγησης Στόλου Οχημάτων (ΠΔΣΟ). Το ΠΔΣΟ ανήκει σε μια ειδική κατηγορία προβλημάτων συνδυαστικής (διακριτής) βελτιστοποίησης που επιζητούν τον καθορισμό της βέλτιστης …

    greece Repository record for Αλγόριθμοι αναπαράστασης και επίλυσης σύνθετων και μεγάλης κλίμακας προβλημάτων συνδυαστικής βελτιστοποίησης: εφαρμογή στο πρόβλημα δρομολόγησης στόλου οχημλατων και στην ανάπτυξη συστημάτων εφοδιαστικής αλυσίδας (opens in a new tab)