Sciweavers

13917 search results - page 138 / 2784
» Abstraction of Probabilistic Systems
Sort
View
INFOCOM
2010
IEEE
14 years 8 months ago
Efficient Tag Identification in Mobile RFID Systems
In this paper we consider how to efficiently identify tags on the moving conveyor. Considering conditions like the path loss and multi-path effect in realistic settings, we first p...
Lei Xie, Bo Sheng, Chiu Chiang Tan, Hao Han, Qun L...
TACAS
2000
Springer
138views Algorithms» more  TACAS 2000»
15 years 1 months ago
Symbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation
This paper reports on experimental results with symbolic model checking of probabilistic processes based on Multi-Terminal Binary Decision Diagrams (MTBDDs). We consider concurrent...
Luca de Alfaro, Marta Z. Kwiatkowska, Gethin Norma...
AC
2000
Springer
14 years 9 months ago
Exact and Approximate Testing/Correcting of Algebraic Functions: A Survey
Abstract. In the late 80's Blum, Luby, Rubinfeld, Kannan et al. pioneered the theory of self
Marcos A. Kiwi, Frédéric Magniez, Mi...
ECRTS
1999
IEEE
15 years 2 months ago
QoS guarantee using probabilistic deadlines
This paper presents a probabilistic approach to guarantee the performance of a real-time system. While traditional real-time system analysis tends to guarantee that each task inst...
Luca Abeni, Giorgio C. Buttazzo
ICNP
2005
IEEE
15 years 3 months ago
Typed Abstraction of Complex Network Compositions
straction of Complex Network Compositions∗ Azer Bestavros, Adam D. Bradley, Assaf J. Kfoury, and Ibrahim Matta Department of Computer Science Boston University The heterogeneity...
Azer Bestavros, Adam Bradley, Assaf J. Kfoury, Ibr...