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 214 for “"efficient algorithm"”.
-
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 …
-
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
-
An efficient algorithm for conformational search of macrocyclic molecules
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1995.
-
An efficient algorithm for sensitivity analysis of chaotic systems
… – from climate science to astrophysics. But, an efficient computation of parametric derivatives of their statistics or long-term averages, also known as linear response, is an open problem. The difficulty is due to an inherent feature of chaos: an exponential growth over time of infinitesimal …
-
Efficient algorithm for online N - 2 power grid contingency selection
… order contingencies. This study presents a novel algorithm for the fast N - 2 contingency selection to address this problem. The developed algorithm identifies all potentially dangerous contingencies with zero missing rate. The complexity of the algorithm is shown to be of the same order as the …
-
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 …
-
A practical and efficient algorithm for the k-mismatch shortest unique substring finding problem
… of the existing solution, resulting in a new algorithm which has expected time complexity of O(n log<sup>k</sup> n), while maintaining a practical space complexity at O(kn), where n is the string length. When k > 0, which is the hard case, the new proposal significantly improves the any-case …
-
The analysis and synthesis of efficient algorithm-based error detection schemes for hypercube multiprocessors
Numerous algorithms for computationally intensive tasks that are suitable for execution on hypercube multiprocessors have been developed by researchers. In this thesis, we look at parallel algorithm design from a different perspective: the provision of on-line detection of hardware errors using …
-
Efficient algorithm to construct phi function in vector space secret sharing scheme and application of secret sharing scheme in Visual Cryptography
… is a positive number. There is no known algorithm to construct such a function in general. We developed an efficient algorithm to construct function for some special secret sharing scheme. We also give an algorithm to demonstrate how a secret sharing scheme can be used in visual …
-
Learning hypertrees with shortest path queries
… of computational learning theory focuses on algorithms for learning discrete structured objects from queries. In this context, we consider the problem of learning a labeled hypergraph from a given family of hypergraphs using shortest path (SP) queries. An SP query specifies two vertices and …
-
Algorithms for design and interrogation of functionally graded material solids
… focuses on the issue of the development of efficient algorithms for design and composition interrogation. Starting with a finite element based 3D model, the design tool based on the distance function from the surface of the part and the design tool allowing the user to design within a .STL …
-
An Algorithm to Generate Two-Dimensional Drawings of Conway Algebraic Knots
The problem of finding an efficient algorithm to create a two-dimensional embedding of a knot diagram is not an easy one. Typically, knots with a large number of crossings will not nicely generate two-dimensional drawings. This thesis presents an efficient algorithm to generate a knot and to create …
-
The Nature of Niching: Genetic Algorithms and the Evolution of Optimal, Cooperative Populations
… sharing might be a computationally intensive yet efficient algorithm (even without the exploration operators of recombination and mutation). (Abstract shortened by UMI.).
-
Distributed computation and inference
In this thesis, we explore questions in algorithms and inference on distributed data. On the algorithmic side, we give a computationally efficient algorithm that allows parties to execute distributed computations in the presence of adversarial noise. This work falls into the framework of …
-
A Real time simulator for power electric networks
… are introduced. A very flexible, portable, and efficient algorithm, which takes advantage of the decoupling due to the signals time delay between sections of a power network separated by transmission lines, is introduced.
-
Variations on the integrated inventory and transportation problem
… new theoretical contributions related to an efficient algorithm for the traveling salesman problem and route failures in fixed partition routing problems with stochastic demand"--Abstract, page iii.
-
Graph Models and Shape Deformation for Image Segmentation
… the template shape topology. In addition, an efficient algorithm is developed to optimize the deformation cost function using quadratic programming.
-
Optimization Problems in Data Mining
… partial orders. For the first, we give an efficient and optimal algorithm for finding all such claims. For the second, we give an algorithm whose running time is significantly more efficient than that of a naive one. Finally, we connect this boasting problem to that of finding a sequence of …
-
Some results on symmetric signings
… with invertible symmetric signings and an efficient algorithm using this characterization to verify whether a given matrix has an invertible symmetric signing. Finally, we give efficient algorithms to verify and find invertible and singular symmetric signing for matrices whose support graph …
-
The effectiveness of a simple policy for coordinating inventory control and pricing strategies
… in terms of profit. In addition, we propose an efficient algorithm with simulated annealing and modified binary search to determine the (s, S, p) policy for the model.
Page 1 of 11