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 33 for “"algorithms and complexity"”.

  1. Adaptive Learning: Algorithms and Complexity

    … domains including computer vision, robotics, and natural language processing. There is a chasm between theory and practice here. Many of the most impressive practical advances in learning rely heavily on parameter tuning and domain-specific heuristics, and the development effort required to …

    cornell Repository record for Adaptive Learning: Algorithms and Complexity (opens in a new tab)

  2. Foundations for quantum algorithms and complexity

    … a lot of interesting from both industry and academia, due to the first results on quantum supremacy, i.e. the first time quantum computers were able to perform efficiently tasks deemed unfeasible to classical computers, made possible by the state-of-art qubit technology. These …

    minho-thes Repository record for Foundations for quantum algorithms and complexity (opens in a new tab)

  3. Cyclability: combinatorial properties, algorithms and complexity

    … the maximum integer k for which G is k-cyclable and it is a connectivity related graph parameter. In this doctoral thesis we study, mainly from the Parameterized Complexity point of view, the Cyclability problem: Given a graph G = (V,E) and an integer k (the parameter), decide whether the …

    greece Repository record for Cyclability: combinatorial properties, algorithms and complexity (opens in a new tab)

  4. Algorithms and complexity for annotated sequence analysis

    Molecular biologists use algorithms that compare and otherwise analyze sequences that represent genetic and protein molecules. Most of these algorithms, however, operate on the basic sequence and do not incorporate the additional information that is often known about the molecule and its pieces. …

    uvic Repository record for Algorithms and complexity for annotated sequence analysis (opens in a new tab)

  5. Tessellations on graphs: theory, algorithms, and complexity

    … walk is fundamental for the development of algorithms for quantum computers. Among the existing quantum walk models, the staggered model, proposed by Portugal et al. stands out, since it includes the Szegedy model as a particular case, and part of the coined model. The staggered model uses …

    brazil-uerj Repository record for Tessellations on graphs: theory, algorithms, and complexity (opens in a new tab)

  6. Algorithms and complexity of graph modification problems

    … problems play important role in both structural and algorithmic graph theory. These problems have been studied for decades and find a large number of practical applications in several different fields in real world. In this thesis, we study a famous edge deletion problem, known under the terms …

    greece Repository record for Algorithms and complexity of graph modification problems (opens in a new tab)

  7. Enumeration, algorithms, and complexity in algebraic combinatorics

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2023-09-01 without embargo terms

    uiuc Repository record for Enumeration, algorithms, and complexity in algebraic combinatorics (opens in a new tab)

  8. Quantum Algorithms and Complexity in Non-standard Models

    … studying restricted models of quantum computing, and then by considering enhanced models of both quantum and classical computing. Both approaches aim to provide insight into the nature and power of universal quantum computers, understand what sorts of problems might be good candidate tasks for …

    bristol Repository record for Quantum Algorithms and Complexity in Non-standard Models (opens in a new tab) Download PDF for Quantum Algorithms and Complexity in Non-standard Models (opens in a new tab)

  9. Path and cycle hitting problems: algorithms and complexity

    … unlikely that there exist polynomial-time algorithms for solving them. Motivated by the fact that many of these problems have real-world applications, researchers have been primarily focused on designing faster and faster exact exponential-time algorithms and better and better approximation …

    greece Repository record for Path and cycle hitting problems: algorithms and complexity (opens in a new tab)

  10. Shop scheduling in manufacturing systems: Algorithms and complexity

    <p>This thesis describes efficient algorithms and complexity results for some machine scheduling and related problems, which are encountered in automated manufacturing systems. We introduce a new class of robotic-cell scheduling models. The novel aspect is that parts need to reenter machines …

    mcmaster Repository record for Shop scheduling in manufacturing systems: Algorithms and complexity (opens in a new tab)

  11. Algorithms and complexity analyses for some combinational optimization problems

    … problems in two important areas: scheduling and network design. In the area of scheduling, the main interest is in problems in the master-slave model. In this model, each machine is either a master machine or a slave machine. Each job is associated with a preprocessing task, a slave task and …

    njit Repository record for Algorithms and complexity analyses for some combinational optimization problems (opens in a new tab)

  12. Distinguishability, Symmetry, and Energy Estimation: Quantum Algorithms and Complexity

    … to use quantum resources, like superposition and entanglement, to process information in a significantly new way. These resources allow quantum computers to solve certain problems more efficiently than their classical counterparts, with promising applications in cryptography, optimization, and …

    cornell Repository record for Distinguishability, Symmetry, and Energy Estimation: Quantum Algorithms and Complexity (opens in a new tab)

  13. Algorithms and Complexity for Alliances and Weighted Alliances of Various Types

    … in 2002 in a paper by Kristiansen, Hedetniemi and Hedetniemi. Although research has been published on the mathematical properties of various types of alliances, until recently, no research has been done to develop algorithms or establish the complexity of decision problems for alliances in …

    clemson Repository record for Algorithms and Complexity for Alliances and Weighted Alliances of Various Types (opens in a new tab)

  14. Towards Better Understanding of Algorithms and Complexity of Some Learning Problems

    … focus on the computational resources required by algorithms to solve learning problems. The computational resources we consider are running time, memory usage and query complexity, which is the number of positions in the input that the algorithm needs to check. Some contributions include: …

    washington Repository record for Towards Better Understanding of Algorithms and Complexity of Some Learning Problems (opens in a new tab)

  15. Algorithms and complexity results for problems on fair division and imitation games

    … allocating indivisible goods to agents in a fair and efficient manner. We consider different notions of fairness such as envy-freeness up to one good (EF1) and envy-freeness up to any good (EFX) in conjuction with Pareto-optimality (PO). We present polynomial time algorithms for computing …

    uiuc Repository record for Algorithms and complexity results for problems on fair division and imitation games (opens in a new tab)

  16. Query equivalence and containment on relational and tree databases

    … subset of another query for any given database. Algorithms for query containment are crucial in several contexts in databases. <br><br>As far as the query containment problem is concerned, various algorithms and complexity results can be obtained, depending on the following three factors:<br>the …

    freiburg-diss Repository record for Query equivalence and containment on relational and tree databases (opens in a new tab)

  17. Topics in Computational Geometry

    Computational geometry is the branch of complexity theory that deals with geometrical problems, and has received much attention in recent years. Presented here are analyses of algorithms and complexity results for certain geometrical problems.

    uiuc Repository record for Topics in Computational Geometry (opens in a new tab)

Page 1 of 2