Browsing AURA by Author "Granmo, Ole-Christoffer"

A formal proof of the e-optimality of discretized pursuit algorithms

Zhang, Xuan; Oommen, John; Granmo, Ole-Christoffer; Lei, Jiao (Journal article; Peer reviewed, 2015)

A formal proof of the ε-optimality of absorbing continuous pursuit algorithms using the theory of regular functions

Zhang, Xuan; Granmo, Ole-Christoffer; Oommen, B. John; Jiao, Lei (Journal article; Peer reviewed, 2014)

The most difficult part in the design and analysis of Learning Automata (LA) consists of the formal proofs of their convergence accuracies. The mathematical techniques used for the different families (Fixed Structure, ...

A framework for assessing the condition of crowds exposed to a fire hazard using a probabilistic model

Radianti, Jaziar; Granmo, Ole-Christoffer (Journal article; Peer reviewed, 2014)

Allocating limited resources in an optimal manner when rescuing victims from a hazard is a complex and error prone task, because the involved hazards are typically evolving over time; stagnating, building up or diminishing. ...

A hierarchical learning scheme for solving the Stochastic Point Location problem

Yazidi, Anis; Granmo, Ole-Christoffer; Oommen, B. John; Goodwin, Morten (Lecture Notes in Computer Science;7345, Chapter; Peer reviewed, 2012)

This paper deals with the Stochastic-Point Location (SPL) problem. It presents a solution which is novel in both philosophy and strategy to all the reported related learning algorithms. The SPL problem concerns the task ...

A novel strategy for solving the stochastic point location problem using a hierarchical searching scheme

Yazidi, Anis; Granmo, Ole-Christoffer; Oommen, John; Goodwin, Morten (Journal article, 2014)

Stochastic point location (SPL) deals with the problem of a learning mechanism (LM) determining the optimal point on the line when the only input it receives are stochastic signals about the direction in which it should ...

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 Stochastic Search on the Line-Based Solution to Discretized Estimation

Yazidi, Anis; Granmo, Ole-Christoffer; Oommen, B. John (Lecture Notes in Computer Science;7345, Chapter; Peer reviewed, 2012)

Recently, Oommen and Rueda [11] presented a strategy by which the parameters of a binomial/multinomial distribution can be estimated when the underlying distribution is nonstationary. The method has been referred to as the ...

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 ...

A two-armed bandit collective for examplar based mining of frequent itemsets with applications to intrusion detection

Haugland, Vegard; Kjølleberg, Marius; Larsen, Svein-Erik; Granmo, Ole-Christoffer (Lecture Notes in Computer Science;6922, Chapter; Peer reviewed, 2011)

Over the last decades, frequent itemset mining has become a major area of research, with applications including indexing and similarity search, as well as mining of data streams, web, and software bugs. Although several ...

A two-armed bandit collective for hierarchical examplar based mining of frequent itemsets with applications to intrusion detection

Haugland, Vegard; Kjølleberg, Marius; Larsen, Svein-Erik; Granmo, Ole-Christoffer (Lecture Notes in Computer Science;8615, Chapter; Peer reviewed, 2014)

In this paper we address the above problem by posing frequent item-set mining as a collection of interrelated two-armed bandit problems. We seek to find itemsets that frequently appear as subsets in a stream of itemsets, ...

A user-centric approach for personalized service provisioning in pervasive environments

Yazidi, Anis; Granmo, Ole-Christoffer; Oommen, B. John; Gerdes, Martin; Reichert, Frank (Journal article; Peer reviewed, 2011)

The vision of pervasive environments is being realized more than ever with the proliferation of services and computing resources located in our surrounding environments. Identifying those services that deserve the attention ...

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 ...