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 104 for “"algorithmic complexity"”.

  1. An information theoretic measure of algorithmic complexity

    … theoretic model which is used to develop a complexity measure of an algorithm. The measure is defined to reflect the computational cost and structure of the given algorithm. In this study computational costs are expressed as the execution times of the algorithm, where the algorithm is coded …

    ubc Repository record for An information theoretic measure of algorithmic complexity (opens in a new tab) Download PDF for An information theoretic measure of algorithmic complexity (opens in a new tab)

  2. Program analysis techniques for algorithmic complexity and relational properties

    … One such example is to derive the asymptotic complexity of a given program. Another example is to verify relational properties, i.e. properties that must be satisfied jointly by multiple programs of multiple runs of one program. Existing program analysis techniques for standard safety …

    texas Repository record for Program analysis techniques for algorithmic complexity and relational properties (opens in a new tab)

  3. Computational Intelligence and Complexity Measures for Chaotic Information Processing

    … developing a generalized algorithm in computing algorithmic complexity measures, Lyapunov exponents, information dimension and topological entropy. These metrics are implemented to characterize the dynamic patterns of discrete and continuous systems. These metrics make it possible to distinguish …

    uno Repository record for Computational Intelligence and Complexity Measures for Chaotic Information Processing (opens in a new tab)

  4. Procedurally Generated Content in Games and its Effect on Player Experience

    This thesis investigates the relationship between algorithmic complexity, procedural content complexity, and user experience for procedural content generation (PCG) in video games. It examines whether increased algorithmic sophistication leads to more varied and higher-quality content, and how such …

    chalmers Repository record for Procedurally Generated Content in Games and its Effect on Player Experience (opens in a new tab)

  5. Topics in Classical and Quantum Optimization: Complexity and Algorithms

    … presents advances revolving around optimization, complexity, and applications of quantum computing. In particular, Part 1 studies information complexity, focusing on convex mixed-integer optimization through the contents of (Basu, Jiang, Kerger, Molinaro 2023), primarily. With new results on lower …

    jhu Repository record for Topics in Classical and Quantum Optimization: Complexity and Algorithms (opens in a new tab)

  6. Optimization,minimax, and variational inequality problems: algorithms and applications

    … biology research. This thesis investigates the algorithmic complexity of such problems, focusing on first-order and second-order methods across different settings. A major theme is the studies of upper and lower bounds on the iteration complexity in each setting and algorithm class, identifying …

    umn Repository record for Optimization,minimax, and variational inequality problems: algorithms and applications (opens in a new tab)

  7. Incorporating equation solving into unification through stratified term rewriting

    … termination and confluence. We also discuss the algorithmic complexity of the reduction algorithm, a vital component of STAR. We compare our system with narrowing and discuss the merits and drawbacks of each technique. Since our system is an experimental integration of equation solving and …

    vt Repository record for Incorporating equation solving into unification through stratified term rewriting (opens in a new tab)

  8. Characterization of Performance, Robustness, and Behavior Relationships in a Directly Connected Material Handling System

    … advantage of observed relationships between complexity and optimality with respect to both performance and robustness. Based on theoretical complexity measures, particularly algorithmic complexity, several simple complexity measures are created. The relationships between these measures and …

    vt Repository record for Characterization of Performance, Robustness, and Behavior Relationships in a Directly Connected Material Handling System (opens in a new tab)

  9. Multi-fractal analysis of nocturnal boundary layer time series from the Boulder Atmospheric Observatory.

    … basis functions, dimensional suitability, noise, algorithmic complexity, and other factors. DA was found to be the only measure capable of reliably distinguishing the wave from turbulence.

    nps Repository record for Multi-fractal analysis of nocturnal boundary layer time series from the Boulder Atmospheric Observatory. (opens in a new tab)

  10. Relative Navigation for the Hubble Servicing Mission using Reflected GPS Signals

    … requiring no additional hardware except added algorithmic complexity. This thesis examines the use of an extended Kalman filter with reflected GPS measurements as a form of bi-static radar. It compares two different types of dynamic models, an absolute orbit model versus Hill's equations. The …

    maryland Repository record for Relative Navigation for the Hubble Servicing Mission using Reflected GPS Signals (opens in a new tab)

  11. Mode-division Multiplexed Transmission In Few-mode Fibers

    … and experiments validate that FDE can reduce the algorithmic complexity significantly in comparison with the conventional time-domain equalization (TDE) while achieving similar performance as TDE. To further improve the performance of FDE, two modifications on traditional FDE algorithm are …

    ucf Repository record for Mode-division Multiplexed Transmission In Few-mode Fibers (opens in a new tab)

  12. Computational Analysis of Antipode Algorithms for the Output Feedback Hopf Algebra

    … need for a more complete understanding of the algorithmic complexity of these methods, as well as the development of new approaches for determining the Hopf algebra antipode. The main goals of this thesis are to create an implementation in code of the derivation method and compare the …

    odu Repository record for Computational Analysis of Antipode Algorithms for the Output Feedback Hopf Algebra (opens in a new tab)

  13. PREDICTING COGNITIVE IMPAIRMENT AND DEMENTIA: MULTIDOMAIN AND MACHINE LEARNING APPROACHES

    … face challenges related to data availability and algorithmic complexity. To address these limitations, this thesis will investigate the associations between multidomain risk factors for cognitive impairment and dementia using population-based datasets. The aim is to efficiently integrate multiple …

    nus Repository record for PREDICTING COGNITIVE IMPAIRMENT AND DEMENTIA: MULTIDOMAIN AND MACHINE LEARNING APPROACHES (opens in a new tab) Download file for PREDICTING COGNITIVE IMPAIRMENT AND DEMENTIA: MULTIDOMAIN AND MACHINE LEARNING APPROACHES (opens in a new tab)

  14. A Multi-Dimensional Width-Bounded Geometric Separator and its Applications to Protein Folding

    … We derived both lower and upper bounds for the algorithmic complexity by using the newly introduced concept of multi-directional width-bounded geometric separator. We proved that for a grid graph G with n grid points P, there exists a balanced separator A subseteq P$ such that A has less than or …

    uno Repository record for A Multi-Dimensional Width-Bounded Geometric Separator and its Applications to Protein Folding (opens in a new tab)

  15. Parametric mixing for centralized VoIP conferencing using ITU-T recommendation G.722.2

    … the packets at the central unit that reduces algorithmic complexity and therefore delay. The parameters used to represent the speech, LPCs, pitch lags, fixed codebook, and gains, are extracted from the encoded bit stream, mixed, and re-encoded instead of full decoding, mixing, and then …

    carleton Repository record for Parametric mixing for centralized VoIP conferencing using ITU-T recommendation G.722.2 (opens in a new tab)

  16. Performance Modeling of In Situ Rendering

    … new statistical performance models, based on algorithmic complexity, that accurately predict the run-time cost of a set of representative rendering algorithms, an essential in situ visualization task. To train and validate the models, we create data-parallel rendering algorithms within a …

    oregon Repository record for Performance Modeling of In Situ Rendering (opens in a new tab)

  17. Region-based compilation

    … compilation unit reduces the importance of the algorithmic complexity of the applied transformations, allowing more aggressive transformations to be applied while reducing compilation time.

    uiuc Repository record for Region-based compilation (opens in a new tab)

Page 1 of 6