5153 search results - page 380 / 1031 » Introduction to Randomized Algorithms |
132
click to vote
RANDOM
2001
Springer
15 years 9 months ago
2001
Springer
We study integrated prefetching and caching in single and parallel disk systems. A recent approach used linear programming to solve the problem. We show that integrated prefetching...
143
click to vote
ICRA
2000
IEEE
2000
IEEE
Local Search Heuristics for the Assembly Line Balancing Problem with Incompatibilities Between Tasks
15 years 9 months ago
This paper deals with the Assembly Line Balancing Problem considering incompatibilities between the tasks with the aim of, first, minimizing the number of workstations and, then, ...
126
click to vote
SACRYPT
1998
Springer
15 years 9 months ago
1998
Springer
Maurer's universal test is a very common randomness test, capable of detecting a wide gamut of statistical defects. The algorithm is simple (a few Java code lines), flexible (...
148
click to vote
COCOA
2008
Springer
15 years 6 months ago
2008
Springer
We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give...
164
click to vote
NIPS
2007
15 years 6 months ago
2007
In this paper we model relational random variables on the edges of a network using Gaussian processes (GPs). We describe appropriate GP priors, i.e., covariance functions, for dir...