Sciweavers

1434 search results - page 36 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
ISIPTA
2003
IEEE
147views Mathematics» more  ISIPTA 2003»
14 years 25 days ago
Reducing Uncertainty by Imprecise Judgements on Probability Distributions: Application to System Reliability
In this paper the judgement consisting in choosing a function that is believed to dominate the true probability distribution of a continuous random variable is explored. This kind...
Igor Kozine, V. Krymsky
FOCS
2000
IEEE
13 years 12 months ago
The Randomness Recycler: A New Technique for Perfect Sampling
For many probability distributions of interest, it is quite difficult to obtain samples efficiently. Often, Markov chains are employed to obtain approximately random samples fro...
James Allen Fill, Mark Huber
STOC
2005
ACM
101views Algorithms» more  STOC 2005»
14 years 1 months ago
The round complexity of two-party random selection
We study the round complexity of two-party protocols for generating a random nbit string such that the output is guaranteed to have bounded bias (according to some measure) even i...
Saurabh Sanghvi, Salil P. Vadhan
IPPS
2007
IEEE
14 years 1 months ago
A Comparative Study of Parallel Metaheuristics for Protein Structure Prediction on the Computational Grid
A comparative study of parallel metaheuristics executed in grid environments is proposed, having as case study a genetic algorithm, a simulated annealing algorithm and a random se...
Alexandru-Adrian Tantar, Nouredine Melab, El-Ghaza...
COLCOM
2007
IEEE
13 years 9 months ago
A random projection approach to subscription covering detection in publish/subscribe systems
Abstract—Subscription covering detection is useful to improving the performance of any publish/subscribe system. However, an exact solution to querying coverings among a large se...
Duc A. Tran, Thinh Nguyen