We study several complexity parameters for first order formulas and their suitability for first order learning models. We show that the standard notion of size is not captured by...
Abstract. Asynchronous automata are parallel compositions of finitestate processes synchronizing over shared variables. A deep theorem due to Zielonka says that every regular trac...
Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor W...
The Maximum Isomorphic Agreement Subtree (MIT) problem is one of the simplest versions of the Maximum Interval Weight Agreement Subtree method (MIWT) which is used to compare phyl...
Paola Bonizzoni, Gianluca Della Vedova, Giancarlo ...
In this paper, we study the simultaneous buffer and wire sizing (SBWS) problem for delay and power dissipation minimization. We prove the BS/WS relation for optimal SBWS solutions...
The paper presents a method for uncertainty propagation in Bayesian networks in symbolic, as opposed to numeric, form. The algebraic structure of probabilities is characterized. Th...