Advanced search
Showing result 1 - 5 of 19 essays matching the above criteria.
-
1. Risk-Averse Multi-Armed Bandit Problem with Multiple Plays
University essay from Göteborgs universitet/Institutionen för data- och informationsteknikAbstract : This study aims to construct an efficient heuristic, referred to as RA, for a riskaverse Markovian multi-armed bandit problem (MAB) with multiple plays. The RA incorporates risk-aversion and multiple plays by modifying the Gittins index strategy. READ MORE
-
2. Reinforcement learning for EV charging optimization : A holistic perspective for commercial vehicle fleets
University essay from KTH/Skolan för industriell teknik och management (ITM)Abstract : Recent years have seen an unprecedented uptake in electric vehicles, driven by the global push to reduce carbon emissions. At the same time, intermittent renewables are being deployed increasingly. These developments are putting flexibility measures such as dynamic load management in the spotlight of the energy transition. READ MORE
-
3. Imitation Learning on Branching Strategies for Branch and Bound Problems
University essay from KTH/Matematisk statistikAbstract : A new branch of machine and deep learning models has evolved in constrained optimization, specifically in mixed integer programming problems (MIP). These models draw inspiration from earlier solver methods, primarily the heuristic, branch and bound. READ MORE
-
4. Energy Sustainable Reinforcement Learning-based Adaptive Duty-Cycling in Wireless Sensor Networks-based Internet of Things Networks
University essay from Luleå tekniska universitet/Institutionen för system- och rymdteknikAbstract : The Internet of Things (IoT) is widely adopted across various fields due to its flexibility and low cost. Energy-harvesting Wireless Sensor Networks (WSNs) are becoming a building block of many IoT applications and provide a perpetual source of energy to power energy-constrained IoT devices. READ MORE
-
5. A comparative analysis of database sanitization techniques for privacy-preserving association rule mining
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : Association rule hiding (ARH) is the process of modifying a transaction database to prevent sensitive patterns (association rules) from discovery by data miners. An optimal ARH technique successfully hides all sensitive patterns while leaving all nonsensitive patterns public. READ MORE