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 54 for “"complexity analysis"”.

  1. Linux, OpenBSD, and Talisker : a comparative complexity analysis

    … structuring, and modularity, as well as software complexity metrics, such as the McCabe Cyclomatic Complexity and the number-of-lines-of-code. In this analysis, we use a reverse engineering tool to show how the three operating systems compare to each other with respect to the qualities of a secure …

    nps Repository record for Linux, OpenBSD, and Talisker : a comparative complexity analysis (opens in a new tab)

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

    In this thesis, results of a study of the heuristic random search optimization method called simulated annealing are given. Most of the 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)

  3. Complexity Analysis of Quantizations of Multidimensional Stochastic Differential Equations

    … SDEs. Furthermore, as part of our analysis, we provide a method which yields a strongly asymptotically optimal sequence of N-quantization of X. In certain special cases our method is fully constructive and the algorithm is easy to implement.

    passau-thes Repository record for Complexity Analysis of Quantizations of Multidimensional Stochastic Differential Equations (opens in a new tab)

  4. Data-Driven Dynamic Decision Making: Algorithms, Structures, and Complexity Analysis

    … of the statistical and computational complexity of data-driven dynamic decision making, which parallels our understanding of supervised machine learning and also accounts for the crucial roles of model structures and constraints for decision making. Specifically, the thesis consists of …

    mit Repository record for Data-Driven Dynamic Decision Making: Algorithms, Structures, and Complexity Analysis (opens in a new tab)

  5. Return on investment and library complexity analysis for DNA sequencing

    Understanding the profiles of information acquisition during DNA sequencing experiments is critical to the design and implementation of large-scale studies in medical and population genetics. One known technical challenge and cost driver in next-generation sequencing data is the occurrence of …

    mit Repository record for Return on investment and library complexity analysis for DNA sequencing (opens in a new tab)

  6. Complexity analysis of lumped parameter models : development of complexity reduction algorithm

    … to be a useful tool for geothermal reservoir analysis and production planning. Tank models are a common form of lumped parameter models, incorporating tanks of given capacitance partially filled with fluid. Between the tanks are connections with given conductance, that allow fluid to flow …

    reykjavik Repository record for Complexity analysis of lumped parameter models : development of complexity reduction algorithm (opens in a new tab)

  7. Extensions of SNOMED taxonomy abstraction networks supporting auditing and complexity analysis

    … it supports. In previous work, the Structural Analysis of Biomedical Ontologies Center (SABOC) team has defined the partial-area taxonomy, a hierarchical abstraction network consisting of units called partial-areas. Each partial-area comprises a set of SNOMED concepts exhibiting a particular …

    njit Repository record for Extensions of SNOMED taxonomy abstraction networks supporting auditing and complexity analysis (opens in a new tab)

  8. Improved Complexity Analysis for the Proximal Bundle Algorithm Under a Novel Perspective

    … Building on this result, we propose a novel complexity analysis of PBA and derive a O (epsilon^-4/5) iteration complexity, improving upon the best known O (epsilon^-2) guarantee. This approach also unveils new insights on bundle management. We then present the first variant of the PBA for …

    mit Repository record for Improved Complexity Analysis for the Proximal Bundle Algorithm Under a Novel Perspective (opens in a new tab)

  9. Complexity Analysis of Physiological Time Series with Applications to Neonatal Sleep Electroencephalogram Signals

    This thesis investigates the complexity in physiological time series with application to neonatal sleep electroencephalography (EEG) signals. Complexity analysis is applied to two clinical data sets of neonatal sleep Electroencephalography(EEG) time series, to uncover the evolution of signal …

    ohiolink Repository record for Complexity Analysis of Physiological Time Series with Applications to Neonatal Sleep Electroencephalogram Signals (opens in a new tab)

  10. Security of Unbalanced Oil-Vinegar Signature Scheme

    … family of TTS systems. Then we have the related complexity analysis to claim that a family of TTS systems can be broken in the time complexity <i>O</i>(2<sup>61</sup>).</p><p>In the second half, we discuss the algebraic attack for the randomly built unbalancedoil-vinegar signature systems with …

    ohiolink Repository record for Security of Unbalanced Oil-Vinegar Signature Scheme (opens in a new tab)

  11. Discrete Adjoints: Theoretical Analysis, Efficient Computation, and Applications

    … adjoints with working accuracy. A complete complexity analysis of the basic modes of automatic differentiation is available. Therefore, the research activities are focused now on different aspects of the derivative calculation, as for example the efficient implementation by exploitation of …

    qucosa-diss

  12. Design, analysis and reconfiguration of defect-tolerant VLSI and parallel processor arrays

    In this thesis, several design, analysis and reconfiguration problems in defect-tolerant VLSI and parallel processor arrays are studied. The NP-hard memory array reconfiguration problem is formulated as a random graph problem, and a provably average-case polynomial time algorithm is presented, …

    uiuc Repository record for Design, analysis and reconfiguration of defect-tolerant VLSI and parallel processor arrays (opens in a new tab)

  13. Comparison of and Improvements to Degree Zero Divisor Class Group Arithmetic in Algebraic Function Fields

    … one infinite place. We performed a theoretical complexity analysis of our algorithms and measured the empirical performance of our implementations. To improve upon [13] we optimized for typical inputs rather than worst case performance, a strategy our empirical analysis demonstrated was …

    calgary Repository record for Comparison of and Improvements to Degree Zero Divisor Class Group Arithmetic in Algebraic Function Fields (opens in a new tab)

  14. Reasoning with model-based belief revision semantics: Theory and implementation

    … in our prototype system, Immortal, analyze the complexity of the algorithms, and report some results from the implementation of the algorithms. The key feature of our algorithms, as shown in the complexity analysis, is that while belief revision is intractable in general, the expected running …

    uiuc Repository record for Reasoning with model-based belief revision semantics: Theory and implementation (opens in a new tab)

  15. Large-scale optimization Methods for data-science applications

    … value, and that plays a fundamental role in the complexity analysis. Based on such measure, we present new computational guarantees for both smooth and non-smooth convex optimization, that can improve existing computational guarantees in several ways, most notably when the initial iterate is far …

    mit Repository record for Large-scale optimization Methods for data-science applications (opens in a new tab)

  16. Robust Fuzzy Cluster Ensemble on Cancer Gene Expression Data

    … has been tremendous growth in the scale and complexity of biological data generated by emerging high-throughput biotechnologies, including gene expression data generated by microarray technology. High-throughput gene expression data may contain gene expression measurements of thousands or …

    unr Repository record for Robust Fuzzy Cluster Ensemble on Cancer Gene Expression Data (opens in a new tab)

  17. Emergency Evacuation Modeling with Consideration of Fairness

    … combinatorial techniques, such as computation complexity analysis, approximation algorithms, numerical optimization, mathematical induction and algebra, and computer programming, are used in the thesis.

    calgary Repository record for Emergency Evacuation Modeling with Consideration of Fairness (opens in a new tab)

  18. Deterministic annealing algorithm: tutorial, application to pickup and delivery problem and computational aspects

    … with time windows. Finally, a computational complexity analysis for DA is presented for a given temperature schedule. The case study focuses on the geometric cooling law $T(t)=\rho T(t-1), 0<\rho<1$, where $T(t)$ is the temperature at time $t$.

    uiuc Repository record for Deterministic annealing algorithm: tutorial, application to pickup and delivery problem and computational aspects (opens in a new tab)

Page 1 of 3