Sciweavers

1612 search results - page 1 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
VOSS
2004
Springer
135views Mathematics» more  VOSS 2004»
13 years 10 months ago
Analysing Randomized Distributed Algorithms
Abstract. Randomization is of paramount importance in practical applications and randomized algorithms are used widely, for example in co-ordinating distributed computer networks, ...
Gethin Norman
SODA
1998
ACM
159views Algorithms» more  SODA 1998»
13 years 6 months ago
Average-Case Analyses of First Fit and Random Fit Bin Packing
We prove that the First Fit bin packing algorithm is stable under the input distribution U{k - 2, k} for all k 3, settling an open question from the recent survey by Coffman, Gar...
Susanne Albers, Michael Mitzenmacher
SPAA
1998
ACM
13 years 8 months ago
Analyses of Load Stealing Models Based on Differential Equations
In this paper we develop models for and analyze several randomized work stealing algorithms in a dynamic setting. Our models represent the limiting behavior of systems as the numb...
Michael Mitzenmacher
SODA
2008
ACM
97views Algorithms» more  SODA 2008»
13 years 6 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...
BMCBI
2007
148views more  BMCBI 2007»
13 years 4 months ago
Computation of significance scores of unweighted Gene Set Enrichment Analyses
Background: Gene Set Enrichment Analysis (GSEA) is a computational method for the statistical evaluation of sorted lists of genes or proteins. Originally GSEA was developed for in...
Andreas Keller, Christina Backes, Hans-Peter Lenho...