Essays about: "thesis on analysis of algorithms"
Showing result 11 - 15 of 603 essays containing the words thesis on analysis of algorithms.
-
11. Evaluating intrusion detection points in an end-to-end solution
University essay from Högskolan i Halmstad/Akademin för informationsteknologiAbstract : Evaluating all intrusion detection points in an end-to-end cyber-physical system can be challenging. This master thesis focuses on evaluating the security of the most exposed part of such systems, Radio Frequency Identification (RFID) communication. READ MORE
-
12. Comparing machine learning algorithms for detecting behavioural anomalies
University essay from Blekinge Tekniska Högskola/Institutionen för datavetenskapAbstract : Background. Attempted intrusions at companies, either from an insider threat orotherwise, is increasing in frequency. Most commonly used is static analysis and filters to stop specific attacks. READ MORE
-
13. Anomaly Detection for Condition Monitoring in Robot Systems
University essay from Uppsala universitet/Institutionen för informationsteknologiAbstract : This thesis addresses the detection of wear patterns in robot joints as an indication of the increase in wear level or impending failures. The main challenges include identifying key wear features, developing efficient anomaly detection algorithms, ensuring generalization across different joints and operating conditions, and enabling real-time monitoring. READ MORE
-
14. GPU-Based Path Optimization Algorithm in High-Resolution Cost Map with Kinodynamic Constraints : Using Non-Reversible Parallel Tempering
University essay from Karlstads universitet/Fakulteten för hälsa, natur- och teknikvetenskap (from 2013)Abstract : This thesis introduces a GPU-accelerated algorithm for path planning under kinodynamic constraints, focusing on navigation of flying vehicles within a high-resolution cost map. The algorithm operates by creating dynamically feasible initial paths, and a non-reversible parallel tempering Markov chain Monte Carlo scheme to optimize the paths while adhering to the nonholonomic kinodynamical constraints. READ MORE
-
15. Domain Knowledge and Representation Learning for Centroid Initialization in Text Clustering with k-Means : An exploratory study
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : Text clustering is a problem where texts are partitioned into homogeneous clusters, such as partitioning them based on their sentiment value. Two techniques to address the problem are representation learning, in particular language representation models, and clustering algorithms. READ MORE
