Different from a traditional wireless sensor network (WSN) powered by nonrechargeable
batteries, the energy management policy of a rechargeable WSN needs to take into account …

Colour refinement is a basic algorithmic routine for graph isomorphism testing, appearing as
a subroutine in almost all practical isomorphism solvers. It partitions the vertices of a graph …

The importance of a node in a directed graph can be measured by its PageRank. The
PageRank of a node is used in a number of application contexts–including ranking websites …

This note provides a simple example demonstrating that, if exact computations are allowed,
the number of iterations required for the value iteration algorithm to find an optimal policy for …

In this paper, we propose an optimal bidding strategy for industrial combined heat and
power (CHP) installations selling their power on multiple markets. This corresponds to the …

When a transition probability matrix is represented as the product of two stochastic matrices,
one can swap the factors of the multiplication to obtain another transition matrix that retains …

Discounted, discrete-time, discrete state-space, discrete action-space Markov decision
processes (MDPs) form a classical topic in control, game theory, and learning, and as a …

The work addresses communication networks established over radio equipped vehicles in
our everyday road traffic, so called Vehicular Ad Hoc Networks (VANETs), and discusses …

In this dissertation, algorithms that create plans to maximize a numeric reward over time are
discussed. A general formulation of this problem is in terms of reinforcement learning (RL) …

Quantitative model checkers for Markov decision processes typically use finite-precision
arithmetic. If all the coefficients in the process are rational numbers, then the model checking …