Sökning: "Black-Box optimering"
Visar resultat 1 - 5 av 11 uppsatser innehållade orden Black-Box optimering.
1. Computationally Efficient Explainable AI: Bayesian Optimization for Computing Multiple Counterfactual Explanantions
Master-uppsats, KTH/Matematik (Avd.)Sammanfattning : In recent years, advanced machine learning (ML) models have revolutionized industries ranging from the healthcare sector to retail and E-commerce. However, these models have become increasingly complex, making it difficult for even domain experts to understand and retrace the model's decision-making process. LÄS MER
2. Tracking Optimization in Agrivoltaic Systems : A Comparative Study for Apple Orchards
Master-uppsats, KTH/Skolan för industriell teknik och management (ITM)Sammanfattning : Agrivoltaic (APV) systems, based on the co-location of solar panels and crops, are an innovative solution to land-use conflicts that often arise between agriculture and energy production. Their optimal functioning starts with efficient management and sharing of light between solar panels and underlying plants. LÄS MER
3. Path Choice Estimation in Urban Rails : Asimulation based optimisation for frequency-based assignment model
Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : Transit system have a large importance in modern urban cities, with urban rail often acting as the central system with it efficient travel time and great capacity. As cities grow in population, so to does the usage of urban rail resulting in increased crowding on the platform and in the trains. LÄS MER
4. Explainable Reinforcement Learning for Remote Electrical Tilt Optimization
Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : Controlling antennas’ vertical tilt through Remote Electrical Tilt (RET) is an effective method to optimize network performance. Reinforcement Learning (RL) algorithms such as Deep Reinforcement Learning (DRL) have been shown to be successful for RET optimization. LÄS MER
5. Bayesian Parameter Tuning of the Ant Colony Optimization Algorithm : Applied to the Asymmetric Traveling Salesman Problem
Kandidat-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : The parameter settings are vital for meta-heuristics to be able to approximate the problems they are applied to. Good parameter settings are difficult to find as there are no general rules for finding them. Hence, they are often manually selected, which is seldom feasible and can give results far from optimal. LÄS MER