Abstract. Hidden Markov models are traditionally decoded by the Viterbi algorithm which finds the highest probability state path in the model. In recent years, several limitations ...
How should a reinforcement learning agent act if its sole purpose is to efficiently learn an optimal policy for later use? In other words, how should it explore, to be able to exp...
We present a model checker for verifying distributed programs written in the Erlang programming language. Providing a model checker for Erlang is especially rewarding since the la...
Recently, a parametric State Reward Markov Model SRMM p has been developed for the reliability and availability analysis of self-healing SONET mesh networks 2 . In this paper, w...
We address performance issues associated with simulationbased algorithms for optimizing Markov reward processes. Specifically, we are concerned with algorithms that exploit the re...