Sciweavers

132 search results - page 2 / 27
» Ellipsoidal Techniques for Reachability Analysis
Sort
View
INFOCOM
2005
IEEE
13 years 10 months ago
On static reachability analysis of IP networks
The primary purpose of a network is to provide reachability between applications running on end hosts. In this paper, we describe how to compute the reachability a network provide...
Geoffrey G. Xie, Jibin Zhan, David A. Maltz, Hui Z...
ICASSP
2010
IEEE
13 years 4 months ago
Learning from high-dimensional noisy data via projections onto multi-dimensional ellipsoids
In this paper, we examine the problem of learning from noisecontaminated data in high-dimensional space. A new learning approach based on projections onto multi-dimensional ellips...
Liuling Gong, Dan Schonfeld
AUTOMATICA
2004
112views more  AUTOMATICA 2004»
13 years 4 months ago
Ellipsoidal parameter or state estimation under model uncertainty
Ellipsoidal outer-bounding of the set of all feasible state vectors under model uncertainty is a natural extension of state estimation for deterministic models with unknown-but-bo...
Boris T. Polyak, Sergey A. Nazin, Cécile Du...
FORMATS
2009
Springer
13 years 8 months ago
Stochastic Games for Verification of Probabilistic Timed Automata
Probabilistic timed automata (PTAs) are used for formal modelling and verification of systems with probabilistic, nondeterministic and real-time behaviour. For non-probabilistic ti...
Marta Z. Kwiatkowska, Gethin Norman, David Parker
SPIN
2010
Springer
13 years 3 months ago
Time-Bounded Reachability in Distributed Input/Output Interactive Probabilistic Chains
Abstract. We develop an algorithm to compute timed reachability probabilities for distributed models which are both probabilistic and nondeterministic. To obtain realistic results ...
Georgel Calin, Pepijn Crouzen, Pedro R. D'Argenio,...