We examine the question of solving the extinction probability of a particular class of continuous-time multi-type branching processes, named Markovian binary trees (MBT). The exti...
Sophie Hautphenne, Guy Latouche, Marie-Ange Remich...
: We consider a problem of searching an element in a partially ordered set (poset). The goal is to find a search strategy which minimizes the number of comparisons. Ben-Asher, Farc...
Text representation is a central task for any approach to automatic learning from texts. It requires a format which allows to interrelate texts even if they do not share content w...
Although many supertree methods have been developed in the last few decades, none has been shown to produce more accurate trees than the popular Matrix Representation with Parsimon...
M. Shel Swenson, Rahul Suri, C. Randal Linder, Tan...
In this paper we present an efficient approach for the fault detection of discrete event systems using Petri nets. We assume that some of the transitions of the net are unobservabl...
Maria Paola Cabasino, Alessandro Giua, Carla Seatz...