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 695 for “"TIME COMPLEXITY"”.

  1. Optimization by Simulated Annealing: A Time-Complexity Analysis

    … results are concerned with the average amount of time simulated annealing takes to find an acceptable solution.

    uiuc Repository record for Optimization by Simulated Annealing: A Time-Complexity Analysis (opens in a new tab)

  2. Highly Accurate Random Phase Approximation Methods With Linear Time Complexity

    … that, without changing the computational complexity, allows to eliminate the error introduced by the resolution-of-the-identity approximation which had been introduced in the previous formulation. Furthermore, in this work a new formulation of the random phase approximation for molecules …

    lmu-germany Repository record for Highly Accurate Random Phase Approximation Methods With Linear Time Complexity (opens in a new tab)

  3. Energy-time complexity of algorithms : modelling the trade-offs of CMOS VLSI

    … a parallel implementation of a task using less time and less energy than a fast uniprocessor. This relies on the energy-time trade-offs present in CMOS circuits, including voltage scaling. Understanding these trade-offs and their connection with algorithms will be a key for extracting …

    ubc Repository record for Energy-time complexity of algorithms : modelling the trade-offs of CMOS VLSI (opens in a new tab) Download PDF for Energy-time complexity of algorithms : modelling the trade-offs of CMOS VLSI (opens in a new tab)

  4. Analysing the empirical time complexity of high-performance algorithms for SAT and TSP

    The time complexity of problems and algorithms, i.e., the scaling of the time required for solving a problem instance as a function of instance size, is of key interest in theoretical computer science and practical applications. In this context, the propositional satisfiability (SAT) and the …

    ubc Repository record for Analysing the empirical time complexity of high-performance algorithms for SAT and TSP (opens in a new tab) Download PDF for Analysing the empirical time complexity of high-performance algorithms for SAT and TSP (opens in a new tab)

  5. The Zeros of Elliptic Curve L-functions: Analytic Algorithms with Explicit Time Complexity

    … elliptic curve is a difficult one, and at the time of the writing of this thesis an unconditional general method for doing so is not known. It has been known for decades that contingent on the Birch and Swinnerton-Dyer Conjecture, an algorithm to compute rank exists, but this algorithm has …

    washington Repository record for The Zeros of Elliptic Curve L-functions: Analytic Algorithms with Explicit Time Complexity (opens in a new tab)

  6. Security systems based on Gaussian integers : Analysis of basic operations and time complexity of secret transformations

    … based PK algorithms. In order to quantify the complexity of the Gaussian integer DLP, it is reduced to two other well known problems: DLP for Lucas sequences and the real integer DLP. Additionally, a novel exponentiation algorithm for Gaussian integers, called Lucas sequence Exponentiation of …

    njit Repository record for Security systems based on Gaussian integers : Analysis of basic operations and time complexity of secret transformations (opens in a new tab)

  7. Representation techniques for relational languages and the worst case asymptotical time complexity behaviour of the related algorithms.

    … aimed at determining the worst case asymptotical time complexity behavior of algorithms for relational operations that work on extensionally or intensionally represented binary relations. Those relational operations come from a relational language being designed at Naval Postgraduate School. One …

    nps Repository record for Representation techniques for relational languages and the worst case asymptotical time complexity behaviour of the related algorithms. (opens in a new tab)

  8. Three-dimensional visualization of multi-layered graphs with application to communications

    … the algorithm does not excess two. The average time complexity of the Incremental Projection Algorithm is O( N N), where N is the number of vertices in a graph. If there is no degree of vertices great than M, the time complexity of the Incremental Projection Algorithm is O(N). The second …

    ottawa-retro Repository record for Three-dimensional visualization of multi-layered graphs with application to communications (opens in a new tab)

  9. Dependence Deduction: A New Perspective in Constructing Matroidal Networks

    … The method due to Dougherty et al. has high time complexity but can create relatively simple network structures from a given matroid. The method due to El Rouayheb et al. has low time complexity, but results in rather complex network structures. This thesis studies the design of matroidal …

    calgary Repository record for Dependence Deduction: A New Perspective in Constructing Matroidal Networks (opens in a new tab)

  10. Crossbar scheduling algorithms for input-queued switches

    … the output ports during each switching cycle, or time slot. A key research challenge in designing large (in number of input/output ports N) input-queued crossbar switches is to develop crossbar scheduling algorithms that can compute high-quality matchings -- i.e., those that result in high switch …

    gatech Repository record for Crossbar scheduling algorithms for input-queued switches (opens in a new tab)

  11. Algorithms and Variations on the Positional Burrows-Wheeler Transform and Their Applications

    … its relevant algorithms to run with unchanged time complexity, but also allows efficient insertion and deletion of haplotypes. We provide insertion and deletion algorithms on the PBWT with average case O(N) time complexity. We also improve upon the query algorithms for the PBWT. Durbin …

    ucf Repository record for Algorithms and Variations on the Positional Burrows-Wheeler Transform and Their Applications (opens in a new tab)

  12. Channel-based Physical Layer Authentication

    … of hypothesis test problems. By exploiting the time-of-arrivals, received signal strengths, and cyclic-features of the channels, support vector machine (SVM) based authentication schemes, the linear Fisher discriminant analysis (LFDA) based authentication scheme, and the combining scheme are …

    waterloo Repository record for Channel-based Physical Layer Authentication (opens in a new tab)

  13. Generative modelling and inverse problem solving for networks in hyperbolic space

    … algorithmic implementation with a O(EN) time complexity, where N is the number of nodes and E the number of edges. Meanwhile, in recent years, the inverse problem has also gained increasing attention: given a network topology, how to provide an accurate mapping into its latent geometrical …

    qucosa-diss

  14. An explicit description of Pieri inclusions.

    … parts, the resulting algorithm has polynomial time complexity whereas the previously known algorithm has exponential time complexity.

    baylor Repository record for An explicit description of Pieri inclusions. (opens in a new tab)

  15. Computation of convex conjugates in linear time using graph-matrix calculus

    … of a bivariate PLQ function, their worst-case time complexity is not linear. Our challenge is to improve the worst case time complexity to linear. We use a planar graph to represent the entities of a PLQ function. Each node of the graph contains a GPH matrix which represents an entity of the …

    ubc Repository record for Computation of convex conjugates in linear time using graph-matrix calculus (opens in a new tab) Download PDF for Computation of convex conjugates in linear time using graph-matrix calculus (opens in a new tab)

  16. Applying binary decision diagrams to learn hidden Markov models

    … operate on Binary Decision Diagrams (BDDs). The time and memory complexity of the algorithm is contingent on the size of the BDD, highlighting that the BDD’s size significantly depends on the variable ordering (a problem known to be NP-complete). Preliminary experiments showed that the BDD size …

    reykjavik Repository record for Applying binary decision diagrams to learn hidden Markov models (opens in a new tab)

Page 1 of 35