Sciweavers

5683 search results - page 701 / 1137
» Interactive Schedulability Analysis
Sort
View
IANDC
2010
116views more  IANDC 2010»
15 years 6 months ago
Weak bisimulation is sound and complete for pCTL*
Abstract. We investigate weak bisimulation of probabilistic systems in the presence of nondeterminism, i.e. labelled concurrent Markov chains (LCMC) with silent transitions. We bui...
Josée Desharnais, Vineet Gupta, Radha Jagad...
IEEECIT
2010
IEEE
15 years 6 months ago
Developing a Cloud Computing Charging Model for High-Performance Computing Resources
Abstract—This paper examines the economics of cloud computing charging from the perspective of a supercomputing resource provider offering its own resources. To evaluate the comp...
Matthew Woitaszek, Henry M. Tufo
IPL
2010
112views more  IPL 2010»
15 years 6 months ago
The cost of probabilistic agreement in oblivious robot networks
In this paper, we look at the time complexity of two agreement problems in networks of oblivious mobile robots, namely, at the gathering and scattering problems. Given a set of ro...
Julien Clement, Xavier Défago, Maria Gradin...
JUCS
2010
108views more  JUCS 2010»
15 years 6 months ago
Integrating Social Networks for Context Fusion in Mobile Service Platforms
: It is important for mobile service providers to be aware of user contexts and to provide contextually relevant mobile services to users. Thereby, in this paper, we propose a nove...
Jason J. Jung
QUESTA
2010
107views more  QUESTA 2010»
15 years 6 months ago
On the inapproximability of M/G/K: why two moments of job size distribution are not enough
The M/G/K queueing system is one of the oldest model for multi-server systems, and has been the topic of performance papers for almost half a century. However, even now, only coar...
Varun Gupta, Mor Harchol-Balter, J. G. Dai, Bert Z...