In this paper, we strengthen two recent undecidability results of [9,10] about weighted timed automata, an extension of timed automata with cost variables. More precisely, we prop...
We study properties of programs with monotone and convex constraints. We extend to these formalisms concepts and results from normal logic programming. They include the notions of...
Robust Optimization is a rapidly developing methodology for handling optimization problems affected by non-stochastic "uncertain-butbounded" data perturbations. In this p...
Abstract. This paper introduces a new algorithm for approximate mining of frequent patterns from streams of transactions using a limited amount of memory. The proposed algorithm co...
The objective of this note is to prove, under certain technical conditions, that the top-Lyapunov exponent of a strictly stationary random sequence of block-triangular matrices is...