The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking ...
Roberto Bagnara, Fred Mesnard, Andrea Pescetti, En...
We consider the classical multi-armed bandit problem with Markovian rewards. When played an arm changes its state in a Markovian fashion while it remains frozen when not played. Th...
An asteroidal triple is a stable set of three vertices such that each pair is connected by a path avoiding the neighborhood of the third vertex. Asteroidal triples play a central ...
As two classical measures, approximation accuracy and consistency degree can be extended for evaluating the decision performance of an incomplete decision table. However, when the...
In this work, we propose to improve the neighboring relationship ability of the Hidden Markov Chain (HMC) model, by extending the memory lengthes of both the Markov chain process ...