Sciweavers

575 search results - page 66 / 115
» Model Checking Restricted Sets of Timed Paths
Sort
View
TCOM
2008
68views more  TCOM 2008»
14 years 11 months ago
Analysis and design of book-ahead bandwidth-sharing mechanisms
In this article, we present a novel discrete-time Markov chain model of book-ahead bandwidthsharing mechanisms. We use this analytical model and a simulation model to understand t...
Xiangfei Zhu, Malathi Veeraraghavan
EPEW
2010
Springer
15 years 29 days ago
Composing Systems While Preserving Probabilities
Abstract. Restricting the power of the schedulers that resolve the nondeterminism in probabilistic concurrent systems has recently drawn the attention of the research community. Th...
Sonja Georgievska, Suzana Andova
SIGMOD
2010
ACM
202views Database» more  SIGMOD 2010»
15 years 4 months ago
PAROS: pareto optimal route selection
Modern maps provide a variety of information about roads and their surrounding landscape allowing navigation systems to go beyond simple shortest path computation. In this demo, w...
Franz Graf, Hans-Peter Kriegel, Matthias Renz, Mat...
ICDT
2010
ACM
161views Database» more  ICDT 2010»
15 years 3 months ago
Data Correspondence, Exchange, and Repair
Checking the correspondence between two or more database instances and enforcing it is a procedure widely used in practice without however having been explored from a theoretical ...
Gösta Grahne, Adrian Onet
ICDT
2010
ACM
193views Database» more  ICDT 2010»
15 years 2 months ago
Data correspondence, exchange and repair
Checking the correspondence between two or more database instances and enforcing it is a procedure widely used in practice without however having been explored from a theoretical ...
Gösta Grahne, Adrian Onet