A tree t-spanner T in a graph G is a spanning tree of G such that the distance between every pair of vertices in T is at most t times their distance in G. The tree t-spanner proble...
Continuous cellular automata (or coupled map lattices) are cellular automata where the state of the cells are real values in [0, 1] and the local transition rule is a real function...
Abstract. The paper presents an unsupervised method for partiallyblurred image restoration without influencing unblurred regions or objects. Maximum a posteriori estimation of para...
In this paper, the authors investigate the problem of designing an observer for Lipschitz nonlinear systems with discrete time measurements (continuous-discrete time systems). The ...
We propose a generic method for obtaining quickly good upper bounds on the minimal value of a multistage stochastic program. The method is based on the simulation of a feasible dec...