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 29 for “"algorithmic complexity"”.
-
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 …
-
Information similarity metrics in information security and forensics
… on compression. The similarity metric, based on algorithmic complexity, proves to be more difficult to estimate due to the fact that algorithmic complexity itself is not computable. We again turn to compression for estimating the similarity metric. Previous studies rely on the compression ratio …
-
Minimaximal and maximinimal optimisation problems : a partial order-based approach
… examples mainly from the point of view of algorithmic complexity.
-
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 …
-
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 …
-
Modeling user network transitions : various approaches
… prediction accuracy, speed of convergence, and algorithmic complexity.
-
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 …
-
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.
-
Optimizing Out-Of-Memory Sparse-Dense Matrix Multiplication
… well as distributed solutions, and analyze the algorithmic complexity and overall overhead involved in our implementation.
-
Multi-criteria optimisation for complex learning prediction systems.
… in this thesis are: accuracy, model complexity, algorithmic complexity, diversity and robustness. The present thesis addresses important challenges related to considering multiple criteria such as: 1) defining suitable measures for the included criteria, 2) determining effective …
-
Energy efficient enabling technologies for semantic video processing on mobile devices
… powered mobile computing devices, the additional algorithmic complexity of semantic object based processing compared to conventional video processing is highly undesirable both from a real-time operation and battery life perspective. This thesis attempts to tackle these issues by firstly …
-
Improving programmability and performance for scientific applications
… more challenging problems. While the size and complexity of both the problems and solutions increases, the programming methodologies must remain at a level that can be understood by programmers and scientists alike. In our work, this problem is encountered when developing an optimized framework …
-
Human-centric verification for software safety and security
… classes of vulnerabilities. The first class is Algorithmic Complexity Vulnerabilities (ACV). ACVs are a class of software security vulnerabilities that cause denial-of-service attacks. The description of an ACV is not known a priori. The problem is equivalent to searching for a needle in the …
-
Biological and metric maps applied to robot homing
… to the problems robots’ encounter which include algorithmic complexity, performance, and power consumption among others. Biological inspiration provides simple, yet effective methods for the solutions of such problems. The careful examination of such methods has twofold gain. The study of the …
-
The Quest for Ideal Quantum Amplifiers
… finance, and cybersecurity. However, the algorithmic complexity, finite qubit coherence, and imperfect control require quantum computers to scale to millions of physical qubits while maintaining low hardware error rates to impact real-world applications, necessitating quantum error …
-
An inertial measurement unit for user interfaces
… designed for this framework have both low algorithmic complexity and low latency, at the price of a small loss in generality. To demonstrate this system, the gesture recognition portion of (void*): A Cast of Characters, an installation which used a pair of hand-held IMUs to capture gestural …
-
Evaluation of Dynamic Channel and Power Assignment Techniques for Cognitive Dynamic Spectrum Access Networks
… channel and power assignment techniques and algorithmic complexity of five different DCPA algorithms. Through simulations, algorithm performance is evaluated by the metrics of feasibility ratio and average power per link. Results show that the centralized algorithm Minimum Power Increase …
-
Attention-based representation learning on graphs
… there is uncertainty regarding the balance of algorithmic complexity, computational resource utilisation, and task performance, with few graph methods consistently performing well across multiple datasets, benchmarks, and settings. This rapid growth of the field produces new challenges, at the …
-
Novel Resonance Self-Shielding Methods for Nuclear Reactor Analysis
… inside the subgroup method without increasing algorithmic complexity. The latter is a hybrid of the subgroup method and ultrafine methods, using an ultrafine energy mesh on the left hand side of the transport equation with the scatter source of the subgroup method on the right hand side. These …
-
Development of the random ray method of neutral particle transport for high-fidelity nuclear reactor simulation
… and it allows for significant reductions in algorithmic complexity on some simulation problems. It also offers a much lower time to solution as compared to MC methods. In this thesis, we will introduce the TRRM algorithm and a parallel implementation of it known as the Advanced Random Ray …
Page 1 of 2