Sciweavers

21 search results - page 2 / 5
» Retaining the Probabilities in Probabilistic Testing Theory
Sort
View
ISSAC
2001
Springer
123views Mathematics» more  ISSAC 2001»
13 years 10 months ago
A probabilistic algorithm to test local algebraic observability in polynomial time
The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the inp...
Alexandre Sedoglavic
ISIPTA
1999
IEEE
116views Mathematics» more  ISIPTA 1999»
13 years 10 months ago
On the Distribution of Natural Probability Functions
The purpose of this note is to describe the underlying insights and results obtained by the authors, and others, in a series of papers aimed at modelling the distribution of `natu...
Jeff B. Paris, Paul N. Watton, George M. Wilmers
ICSE
1997
IEEE-ACM
13 years 10 months ago
Choosing a Testing Method to Deliver Reliability
Testing methods are compared in a model where program failures are detected and the software changed to eliminate them. The question considered is whether it is better to use test...
Phyllis G. Frankl, Richard G. Hamlet, Bev Littlewo...
COLT
2007
Springer
13 years 12 months ago
Occam's Hammer
Abstract. We establish a generic theoretical tool to construct probabilistic bounds for algorithms where the output is a subset of objects from an initial pool of candidates (or mo...
Gilles Blanchard, François Fleuret
FOSSACS
2003
Springer
13 years 11 months ago
An Intrinsic Characterization of Approximate Probabilistic Bisimilarity
In previous work we have investigated a notion of approximate bisimilarity for labelled Markov processes. We argued that such a notion is more realistic and more feasible to compu...
Franck van Breugel, Michael W. Mislove, Joël ...