Sciweavers

5785 search results - page 532 / 1157
» Approximability of Probability Distributions
Sort
View
PODC
2010
ACM
15 years 11 months ago
A modular approach to shared-memory consensus, with applications to the probabilistic-write model
We define two new classes of shared-memory objects: ratifiers, which detect agreement, and conciliators, which ensure agreement with some probability. We show that consensus can...
James Aspnes
260
Voted
WCNC
2010
IEEE
15 years 11 months ago
Adaptive Multiple Relay Selection Scheme for Cooperative Wireless Networks
Abstract—In this paper, we propose an output-threshold multiple relay selection scheme for dual-hop multi-branch cooperative wireless networks. The proposed scheme selects the ...
Gayan Amarasuriya, Masoud Ardakani, Chintha Tellam...
TACAS
2000
Springer
138views Algorithms» more  TACAS 2000»
15 years 10 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...
DEXA
2006
Springer
116views Database» more  DEXA 2006»
15 years 9 months ago
Interpolating and Using Most Likely Trajectories in Moving-Objects Databases
In recent years, many emerging database applications deal with large sets of continuously moving data objects. Since no computer system can commit continuously occurring infinitesi...
Byunggu Yu, Seon Ho Kim
SODA
2008
ACM
97views Algorithms» more  SODA 2008»
15 years 8 months ago
Stochastic analyses for online combinatorial optimization problems
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...
Naveen Garg, Anupam Gupta, Stefano Leonardi, Piotr...