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 857 for “"Efficient algorithm"”.

  1. An Efficient Algorithm for Relationship Inference

    … and needs to be determined. Here, we develop an algorithm to infer relatedness among samples that we aim to be more efficient than current related approaches such as PLINK. Our approach is based on finding stretches of shared alleles across windows of moderate length (3-5 centiMorgans) in the …

    cornell Repository record for An Efficient Algorithm for Relationship Inference (opens in a new tab)

  2. Energy-efficient algorithm design for wireless sensor networks

    … a sink. In this thesis, we propose several power efficient algorithms for WSNs. First, we formulate the lexicographically optimal commodity lifetime routing problem. We propose the lexicographically optimal node lifetime algorithm, which is suitable for practical implementation. Simulation results …

    ubc Repository record for Energy-efficient algorithm design for wireless sensor networks (opens in a new tab) Download PDF for Energy-efficient algorithm design for wireless sensor networks (opens in a new tab)

  3. Efficient algorithm for selecting protein residue-residue contacts

    … used as inputs to a protein structure prediction algorithm to produce ""decoy"" models as tentative 3D structures for proteins. However, the computation power required for structural prediction grows exponentially with respect to the number of contacts selected. Thus selecting few and yet …

    uiuc Repository record for Efficient algorithm for selecting protein residue-residue contacts (opens in a new tab)

  4. Efficient Algorithm for Learning and Generation with Reinforcement Learning

    … increasingly complex challenges that demand efficient algorithmic solutions across diverse domains. Reinforcement learning (RL), as a fundamental paradigm for sequential decision-making under uncertainty, faces critical efficiency bottlenecks that limit its practical deployment: NP hardness …

    tamu Repository record for Efficient Algorithm for Learning and Generation with Reinforcement Learning (opens in a new tab) Embargoed until 2028-05-01

  5. Efficient Algorithm for Learning and Generation with Reinforcement Learning

    … increasingly complex challenges that demand efficient algorithmic solutions across diverse domains. Reinforcement learning (RL), as a fundamental paradigm for sequential decision-making under uncertainty, faces critical efficiency bottlenecks that limit its practical deployment: NP hardness …

    tamu Repository record for Efficient Algorithm for Learning and Generation with Reinforcement Learning (opens in a new tab) Embargoed until 2028-05-01

  6. Comparative genomics: multiple genome rearrangement and efficient algorithm development

    … problem is NP-hard and can only be solved by efficient approximation algorithms. Various algorithms/programs have been designed to solve the problem, such as BPAnalysis, GRAPPA, grid search algorithm, MGR greedy split algorithm (Chapter 1). However, they may have expensive computational costs …

    iastate Repository record for Comparative genomics: multiple genome rearrangement and efficient algorithm development (opens in a new tab)

  7. Ascent dynamics: an efficient algorithm probing long timescale dynamics

    Submission published under a 24 month embargo labeled 'Closed Access', the embargo will last until 2024-05-01

    uiuc Repository record for Ascent dynamics: an efficient algorithm probing long timescale dynamics (opens in a new tab)

  8. Efficient Algorithm with No-Regret Bound for Sleeping Expert Problem

    … change. Under those constraints, we present an efficient algorithm which achieves a sub-linear ranking regret bound.

    waterloo Repository record for Efficient Algorithm with No-Regret Bound for Sleeping Expert Problem (opens in a new tab)

  9. Large scale semidefinite programming: simplicity, conditioning, and an efficient algorithm

    … sensitivity of solution. Finally, we design an algorithm that is provably computationally efficient in terms of storage and time under simplicity.

    cornell Repository record for Large scale semidefinite programming: simplicity, conditioning, and an efficient algorithm (opens in a new tab)

  10. Extending the Network Life Time in WSN Using Energy Efficient Algorithm

    … is drained during communication. An energy efficient routing algorithm can prolong the lifetime of the network by gradually depleting the nodes in the network. Many of the routing protocols that have been proposed are computationally complex and possess certain hardware capabilities in order …

    odu Repository record for Extending the Network Life Time in WSN Using Energy Efficient Algorithm (opens in a new tab)

  11. Efficient algorithm for simulation of the time-domain Maxwell system, An

    … is a versatile family of schemes and provides an efficient framework for the parallel implementation we consider. FDTD is a popular method for computing approximate solutions of the time-domain Maxwell system that may include a variety of heterogeneous material types and network elements. …

    colo-mines Repository record for Efficient algorithm for simulation of the time-domain Maxwell system, An (opens in a new tab)

  12. Oblivious Multi-Way Band Joins: An Efficient Algorithm for Secure Range Queries

    This thesis introduces the first efficient oblivious algorithm for acyclic multi-way joins with band conditions, extending the classical Yannakakis algorithm to support inequality predicates (>, <, ≥, ≤) without leaking sensitive information through memory access patterns. Band joins, which match …

    waterloo Repository record for Oblivious Multi-Way Band Joins: An Efficient Algorithm for Secure Range Queries (opens in a new tab)

  13. Efficient algorithm and architecture for implementation of multiplier circuits in modern EPGAs

    … multipliers out of smaller ones by giving two algorithms to the system designer, for a given FPGA technology. Large word length is required in applications such as cryptography and video processing. The first proposed algorithm partitions large input multipliers into an architecture-aware …

    concordia Download PDF for Efficient algorithm and architecture for implementation of multiplier circuits in modern EPGAs (opens in a new tab)

  14. Efficient algorithm for RNA pseudoknotted secondary structure prediction given a pseudoknot free structure

    … In this thesis, we introduce a Pseudoknot-Add algorithm for the problem of Predicting Pseudoknot Additions. In this problem, one is given as input a sequence S and pseudoknot free structure G, and the goal is to find the minimum free energy pseudoknotted structure R for S, that contains G. The …

    ubc Repository record for Efficient algorithm for RNA pseudoknotted secondary structure prediction given a pseudoknot free structure (opens in a new tab) Download PDF for Efficient algorithm for RNA pseudoknotted secondary structure prediction given a pseudoknot free structure (opens in a new tab)

  15. Development of a fast and efficient algorithm for P300 event related potential detection

    … in parallel. This research also presents a novel algorithm for optimizing P300 spelling speed to improve the throughput of a P300 based BCI speller. Increasing speed is an important concern for any future mobile application of the BCI technology (e.g., a tablet), because battery life and processor …

    temple Repository record for Development of a fast and efficient algorithm for P300 event related potential detection (opens in a new tab)

  16. Optimal structure and efficient algorithm for max-min fair multi-group multicast beamforming

    … optimal beamforming structure, we propose two algorithms by either direct method via successive convex approximation (SCA), or solving the QoS problem iteratively. For massive MIMO systems, we propose an efficient MMF multicast beamforming design based on the optimal solution structure. The …

    uoit Repository record for Optimal structure and efficient algorithm for max-min fair multi-group multicast beamforming (opens in a new tab)

Page 1 of 43