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 41 for “"Runtime Analysis"”.
-
Runtime Analysis on the (1+1) Memetic Algorithms
… understanding of Memetic Algorithms by using runtime analysis. In the last decade, theoretical studies of Memetic Algorithms have achieved remarkable progress, but still lag behind experiments. In particular, three approaches have been studied extensively in experiments, but few studies in …
-
Unifying Static And Runtime Analysis In Declarative Distributed Systems
… demand pre-deployment verification (i.e., static analysis) which, though time-consuming, explores the whole execution space. However, due to the potential problem of state explosion, static verification of all properties is not practical, and not necessary. Violation of non-critical properties, …
-
A Framework for the Runtime Analysis of Algorithm Configurators
… state-of-the-art in the field of fixed-budget analysis.
-
Automated Runtime Analysis and Adaptation for Scalable Heterogeneous Computing
… extracting optimal performance via manual analysis and optimization is a complicated and time-consuming process. This dissertation presents graph-structured program representations to reason about the performance bottlenecks on modern HPC systems and to guide novel automation frameworks for …
-
Advancing Cybersecurity Through Userland Memory Forensics: From Runtime Analysis to Security Applications
… techniques have largely focused on kernel-level analysis, leaving userland runtimes insufficiently covered. This dissertation addresses this gap by expanding memory analysis capabilities across two distinct paradigms: interpreted and compiled runtimes. The first phase targets the Python runtime, …
-
On the Runtime Analysis of Selection Hyper-heuristics for Pseudo-Boolean Optimisation
… problem classes. Through a rigorous theoretical analysis, we show that while four commonly applied simple SHHs from the literature do not learn to select the most promising low-level heuristics, generalising them such that application of the chosen heuristic occurs over a longer period of time …
-
Runtime Analysis of Success-Based Parameter Control Mechanisms for Evolutionary Algorithms on Multimodal Problems
… fruitful research area. However, most existing runtime analyses focus on simple problems with benign characteristics, for which fixed parameter settings already run efficiently and only moderate performance gains were shown. The aim of this thesis is to understand how parameter control …
-
RUNTIME ANALYSIS OF BENDERS DECOMPOSITION AND DUAL ILP ALGORITHMS AS APPLIED TO COMMON NETWORK INTERDICTION PROBLEMS
… attacker's budget and we record each algorithm’s runtime. Our results indicate that Benders decomposition performs best when solving the shortest path interdiction problem on a grid network, the dual integer linear program performs better for the maximum flow problem on both the grid and layered …
-
Theoretical and Empirical Evaluation of Diversity-preserving Mechanisms in Evolutionary Algorithms: On the Rigorous Runtime Analysis of Diversity-preserving Mechanisms in Evolutionary Algorithms
… of efficient and effective EAs. The resulting runtime bounds are used to predict and to judge the performance of algorithms for arbitrary problem sizes, further used to clarify important design issues from a theoretical perspective. We combine theoretical research with empirical applications to …
-
Custom and model based detection of deficiencies related to Java multithreading
… Thus automatic bug detection techniques, such as runtime analysis, static analysis, model checking and theorem proving are applied. Runtime analysis is based on the idea of concluding properties of interest from a single run of the program. We implement and compare two runtime analysis approaches, …
-
FPRAS Approximation of the Matrix Permanent in Practice
… We present an implementation and detailed runtime analysis of one such Markov Chain Monte Carlo (MCMC) based Fully Polynomial Randomized Approximation Scheme (FPRAS) for the matrix permanent which has previously only been described theo- retically and with big-Oh runtime analysis. We …
-
Practical Analysis for Refactoring
… dissertation also examines techniques for using runtime analysis to assist refactoring, presents the design of the Refactoring Browser, a refactoring tool for Smalltatk that is used by commercial software developers, and identifies the criteria that are necessary for any refactoring tool to …
-
Machine learning-based performance analytics for high-performance computing systems
… complexity and volume of this data, manual analysis is often daunting and inefficient. Machine learning (ML) techniques offer automated performance anomaly diagnosis, but the transition from successful research outcomes to production-scale deployment encounters two critical obstacles. First, …
-
Incremental Model-to-Text Transformation
… change propagation: they use a form of runtime analysis that identifies the impact of source model changes on generated textual artefacts. The structures produced by this runtime analysis, are used to perform efficient incremental transformations (scalable transformations). This claim is …
-
Evolving Solutions to Graph Theory Problems
… graceful labeling.We present the first rigorous runtime analysis of an evolutionary algorithm findinggraceful labelings of graphs, and prove polynomial time upper bounds for paths, stars,and complete bipartite graphs with a constant sized partition. To supplement thetheoretical results, we also …
-
A fail-slow tolerant Raft implementation
… of this intolerance, we perform a comprehensive analysis on each database and categorize them into patterns. Every pattern is heavily connected to the implementation rather than the algorithm design. We extend our own programming library, DepFast, that facilitates programmers to write fail-slow …
-
Meta-Feature Taxonomy for Supporting Automatic Machine Learning
… for their applications. Additionally, a runtime analysis of the wall-clock time required for meta-feature generation is provided for 18 data collections found in previous CHALearn AutoML competitions, which took between 0:10:26.9, and 98:43:46.5. Additionally we found that a sample …
-
Computational Guidance and Control for Aerospace Systems
… of these algorithms are presented. Runtime analysis offers initial evidence that it is possible to solve explicit trajectory optimization problems reliably and fast enough to be considered a viable technology. As an alternative approach, implicit trajectory generation computes a set …
-
Augmentation of Visual Odometry using Radar
… to perform costly depth estimations. Trajectory analysis of the proposed algorithm on outdoor data, compared to differential GPS data, shows that the proposed algorithm is more accurate in terms of root-mean-square error, as well as having a lower percentage of scale error. Runtime analysis shows …
-
Fpga Implementation And Study Of Hardware Trojan In A Closed Loop Control System
… hardware. Through this platform, a comprehensive runtime analysis of hardware Trojan is accomplished and we developed four threat models that can lead to destabilization of the closed-loop system causing hazardous conditions. Since the primary objective is to study the effects of hardware Trojans, …
Page 1 of 3