Sökning: "empirical algorithm."
Visar resultat 1 - 5 av 134 uppsatser innehållade orden empirical algorithm..
1. Models, Keys, and Cryptanalysis: Evaluating historical statistical language models in cryptanalysis of homophonic substitution ciphers
Kandidat-uppsats, Göteborgs universitet/Institutionen för filosofi, lingvistik och vetenskapsteoriSammanfattning : This thesis presents an empirical study connected to historical cryptography and especially within the framework of the research project DECRYPT. One of the research questions in the DECRYPT project relates to the use of language models for automatic cryptanalysis. LÄS MER
2. Commercialization of a Niche Sustainable Microwave AI Technology Innovation : A case study in Percy Roc AB
Master-uppsats, Uppsala universitet/Industriell teknikSammanfattning : Nowadays, increasing energy costs create challenges for societies. In industries such as manufacturing, energy is one of the basic needs for development, automation, and modernization. The increase in energy costs affects economic growth, especially, in the manufacturing industry which depends on the energy consumption to run their facilities. LÄS MER
3. Human-Centered Explainability Attributes In Ai-Powered Eco-Driving : Understanding Truck Drivers' Perspective
Master-uppsats, Högskolan i Halmstad/Akademin för informationsteknologiSammanfattning : The growing presence of algorithm-generated recommendations in AI-powered services highlights the importance of responsible systems that explain outputs in a human-understandable form, especially in an automotive context. Implementing explainability in recommendations of AI-powered eco-driving is important in ensuring that drivers understand the underlying reasoning behind the recommendations. LÄS MER
4. Empirical Evaluation of Construction Methods for Relaxed Decision Diagrams in Scheduling
Master-uppsats, Linköpings universitet/Programvara och systemSammanfattning : Decision diagrams have recently emerged as a promising approach for difficult scheduling problems, along with other challenging discrete optimization problems. Decision diagrams can offer a compact representation of the solution space, and has the ability to capture complex constraints that are hard to model or express in other techniques. LÄS MER
5. Stochastic Frank-Wolfe Algorithm : Uniform Sampling Without Replacement
Master-uppsats, Umeå universitet/Institutionen för matematik och matematisk statistikSammanfattning : The Frank-Wolfe (FW) optimization algorithm, due to its projection free property, has gained popularity in recent years with typical application within the field of machine learning. In the stochastic setting, it is still relatively understudied in comparison to the more expensive projected method of Stochastic Gradient Descent (SGD). LÄS MER