5115 search results - page 635 / 1023 » On Randomized Lanczos Algorithms |
187
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We study the management of buffers and storages in environments with unpredictably varying prices in a competitive analysis. In the economical caching problem, there is ...
198
click to vote
TALG
2010
15 years 1 months ago
2010
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
179
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
203
click to vote
UAI
1997
15 years 8 months ago
1997
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
197
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...