Sciweavers

325 search results - page 55 / 65
» The Algebraic Framework for Object-Oriented Systems
Sort
View
CONCUR
2001
Springer
14 years 5 days ago
Symbolic Computation of Maximal Probabilistic Reachability
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sprost...
TIM
2010
144views Education» more  TIM 2010»
13 years 2 months ago
Extending Polynomial Chaos to Include Interval Analysis
Polynomial chaos theory (PCT) has been proven to be an efficient and effective way to represent and propagate uncertainty through system models and algorithms in general. In partic...
Antonello Monti, Ferdinanda Ponci, Marco Valtorta
EDBT
2000
ACM
13 years 11 months ago
Navigation-Driven Evaluation of Virtual Mediated Views
The MIX mediator systems incorporates a novel framework for navigation-driven evaluation of virtual mediated views. Its architecture allows the on-demand computation of views and q...
Bertram Ludäscher, Yannis Papakonstantinou, P...
SIGMOD
2008
ACM
139views Database» more  SIGMOD 2008»
14 years 7 months ago
Paths to stardom: calibrating the potential of a peer-based data management system
As peer-to-peer (P2P) networks become more familiar to the database community, intense interest has built up in using their scalability and resilience properties to scale database...
Mihai Lupu, Beng Chin Ooi, Y. C. Tay
ENTCS
2006
134views more  ENTCS 2006»
13 years 7 months ago
Anonymity in Probabilistic and Nondeterministic Systems
Anonymity means that the identity of the user performing a certain action is maintained secret. The protocols for ensuring anonymity often use random mechanisms which can be descr...
Catuscia Palamidessi