Sciweavers

4007 search results - page 130 / 802
» Computation with imprecise probabilities
Sort
View
TMC
2010
143views more  TMC 2010»
15 years 3 months ago
Decentralized QoS-Aware Checkpointing Arrangement in Mobile Grid Computing
—This paper deals with decentralized, QoS-aware middleware for checkpointing arrangement in Mobile Grid (MoG) computing systems. Checkpointing is more crucial in MoG systems than...
Paul J. Darby III, Nian-Feng Tzeng
FOCS
2007
IEEE
15 years 11 months ago
Polylogarithmic Independence Can Fool DNF Formulas
We show that any k-wise independent probability distribution on {0, 1}n O(m2.22− √ k/10)fools any boolean function computable by an m-clause DNF (or CNF) formula on n variable...
Louay Bazzi
CONCUR
2000
Springer
15 years 9 months ago
Verifying Quantitative Properties of Continuous Probabilistic Timed Automata
Abstract. We consider the problem of automatically verifying realtime systems with continuously distributed random delays. We generalise probabilistic timed automata introduced in ...
Marta Z. Kwiatkowska, Gethin Norman, Roberto Segal...
LCN
2003
IEEE
15 years 10 months ago
Multi-Class Bandwidth Allocation Policy for 3G Wireless Networks
In this paper we develop an analytical threshold-based bandwidth allocation policy for 3G multi-class cellular networks. We consider the effects of user mobility when the cellular...
Nidal Nasser, Hossam S. Hassanein
PVLDB
2010
97views more  PVLDB 2010»
15 years 3 months ago
Ranking Continuous Probabilistic Datasets
Ranking is a fundamental operation in data analysis and decision support, and plays an even more crucial role if the dataset being explored exhibits uncertainty. This has led to m...
Jian Li, Amol Deshpande