Sciweavers

801 search results - page 90 / 161
» Minimal Locked Trees
Sort
View
DAGSTUHL
2007
14 years 11 months ago
Matrix Analytic Methods in Branching processes
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...
DAM
2008
135views more  DAM 2008»
14 years 10 months ago
Edge ranking and searching in partial orders
: 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...
Dariusz Dereniowski
COLING
2002
14 years 9 months ago
Hierarchical Orderings of Textual Units
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...
Alexander Mehler
WABI
2010
Springer
141views Bioinformatics» more  WABI 2010»
14 years 8 months ago
An Experimental Study of Quartets MaxCut and Other Supertree Methods
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...
AUTOMATICA
2010
106views more  AUTOMATICA 2010»
14 years 8 months ago
Fault detection for discrete event systems using Petri nets with unobservable transitions
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...