5153 search results - page 575 / 1031 » Introduction to Randomized Algorithms |
179
click to vote
LATIN
2010
Springer
15 years 8 months ago
2010
Springer
In this paper we describe algorithms for computing the BWT and for building (compressed) indexes in external memory. The innovative feature of our algorithms is that they are light...
184
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...
187
click to vote
SODA
2007
ACM
15 years 7 months ago
2007
ACM
We study a generalization of the classical secretary problem which we call the “matroid secretary problem”. In this problem, the elements of a matroid are presented to an onli...
155
click to vote
USENIX
2000
15 years 7 months ago
2000
We examine a policy for managing modem pools that disconnects users only if not enough modems are available for other users to connect. Managing the modem pool then becomes a repl...
162
Voted
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
Rigorous runtime analyses of evolutionary algorithms (EAs) mainly investigate algorithms that use elitist selection methods. Two algorithms commonly studied are Randomized Local S...