5153 search results - page 107 / 1031 » Introduction to Randomized Algorithms |
131
click to vote
FGCS
2006
15 years 2 months ago
2006
We consider a model where commodity service providers are offering commodity computational services to a set of customers. We provide a solution for the efficient distribution of ...
111
Voted
JCSS
2010
15 years 26 days ago
2010
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...
143
click to vote
IEEEPACT
1997
IEEE
15 years 6 months ago
1997
IEEE
† In this paper, we propose a parallel randomized algorithm, called Parallel Fast Assignment using Search Technique (PFAST), for scheduling parallel programs represented by direc...
133
click to vote
ESA
2008
Springer
15 years 4 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
100
click to vote
STOC
2003
ACM
16 years 2 months ago
2003
ACM
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...