5606 search results - page 560 / 1122 » Randomization Techniques for Graphs. |
164
click to vote
STACS
2004
Springer
16 years 16 days ago
2004
Springer
We consider the problem of preemptive scheduling on uniformly related machines. We present a semi-online algorithm which, if the optimal makespan is given in advance, produces an ...
175
click to vote
CRYPTO
1993
Springer
15 years 11 months ago
1993
Springer
Cryptographic techniques have been used intensively in the past to show how to play multiparty games in an adversarial scenario. We now investigate the cryptographic power of a dec...
169
click to vote
ESA
2006
Springer
15 years 11 months ago
2006
Springer
A standard technique from the hashing literature is to use two hash functions h1(x) and h2(x) to simulate additional hash functions of the form gi(x) = h1(x) + ih2(x). We demonstra...
206
click to vote
IRREGULAR
1995
Springer
15 years 10 months ago
1995
Springer
In this paper, we review parallel search techniques for approximating the global optimal solution of combinatorial optimization problems. Recent developments on parallel implementa...
193
click to vote
ESANN
2006
15 years 8 months ago
2006
Currently the best algorithms for transcription factor binding site prediction are severely limited in accuracy. In previous work we combine random selection under-sampling with th...