608 search results - page 13 / 122 » On Dependent Randomized Rounding Algorithms |
IJCAI
2007
13 years 9 months ago
2007
We study auction-like algorithms for the distributed allocation of tasks to cooperating agents. To reduce the team cost of sequential single-item auction algorithms, we generalize...
RSA
2010
13 years 6 months ago
2010
In this paper we analyze the appearance of a Hamilton cycle in the following random process. The process starts with an empty graph on n labeled vertices. At each round we are pre...
MP
2007
13 years 7 months ago
2007
We consider machine scheduling on unrelated parallel machines with the objective to minimize the schedule makespan. We assume that, in addition to its machine dependence, the proce...
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
In the weighted paging problem there is a weight (cost) for fetching each page into the cache. We design a randomized O(log k)-competitive online algorithm for the weighted paging...
SIAMCOMP
2012
11 years 10 months ago
2012
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...