Blar i AURA på forfatter "Glimsdal, Sondre"
-
A spatio-temporal probabilistic model of hazard and crowd dynamics in disasters for evacuation planning
Granmo, Ole-Christoffer; Radianti, Jaziar; Goodwin, Morten; Dugdale, Julie; Sarshar, Parvaneh; Glimsdal, Sondre; Gonzalez, Jose J. (Lecture Notes in Computer Science;7906, Chapter; Peer reviewed, 2013)Managing the uncertainties that arise in disasters – such as ship fire – can be extremely challenging. Previous work has typically focused either on modeling crowd behavior or hazard dynamics, targeting fully known ... -
A two-armed bandit based scheme for accelerated decentralized learning
Granmo, Ole-Christoffer; Glimsdal, Sondre (Lecture Notes in Computer Science;6704, Chapter; Peer reviewed, 2011)The two-armed bandit problem is a classical optimization problem where a decision maker sequentially pulls one of two arms attached to a gambling machine, with each pull resulting in a random reward. The reward distributions ... -
Accelerated Bayesian learning for decentralized two-armed bandit based decision making with applications to the Goore Game
Granmo, Ole-Christoffer; Glimsdal, Sondre (Journal article; Peer reviewed, 2012)The two-armed bandit problem is a classical optimization problem where a decision maker sequentially pulls one of two arms attached to a gambling machine, with each pull resulting in a random reward. The reward distributions ... -
Ant colony optimisation for planning safe escape routes
Goodwin, Morten; Granmo, Ole-Christoffer; Radianti, Jaziar; Sarshar, Parvaneh; Glimsdal, Sondre (Lecture Notes in Computer Science;7906, Chapter; Peer reviewed, 2013)An emergency requiring evacuation is a chaotic event filled with uncertainties both for the people affected and rescuers. The evacuees are often left to themselves for navigation to the escape area. The chaotic situation ... -
Building Concise Logical Patterns by Constraining Tsetlin Machine Clause Size
Abeyrathna, Kuruge Darshana; Abouzeid, Ahmed Abdulrahem Othman; Bhattarai, Bimal; Giri, Charul; Glimsdal, Sondre; Granmo, Ole-Christoffer; Lei, Jiao; Saha, Rupsa; Sharma, Jivitesh; Tunheim, Svein Anders; Zhang, Xuan (Academic article, 2023)Tsetlin machine (TM) is a logic-based machine learning approach with the crucial advantages of being transparent and hardware-friendly. While TMs match or surpass deep learning accuracy for an increasing number of applications, ... -
Efficient gaussian process based optimistic knapsack sampling with applications to stochastic resource allocation
Glimsdal, Sondre (Master thesis, 2013)The stochastic non-linear fractional knapsack problem is a challeng- ing optimization problem with numerous applications, including resource allocation. The goal is to nd the most valuable mix of materials that ts ... -
Interpretable Tsetlin Machine For Explaining Board Games With Complex Game States
Varpe, Joar (Master thesis, 2022)Stefan Dorra's For Sale is both a turn-based and simultaneous action zero-sum game where the objective is to become as rich as possible. The first phase of the game is a sequence of turn-based English auctions that bids ... -
Thompson sampling guided stochastic searching on the line for deceptive environments with applications to root-finding problems
Glimsdal, Sondre; Granmo, Ole-Christoffer (Peer reviewed; Journal article, 2019) -
Towards Thompson Sampling for Complex Bayesian Reasoning
Glimsdal, Sondre (Doctoral Dissertation at the University of Agder; no. 275, Doctoral thesis, 2020)Thompson Sampling (TS) is a state-of-art algorithm for bandit problems set in a Bayesian framework. Both the theoretical foundation and the empirical efficiency of TS is wellexplored for plain bandit problems. However, the ...