4377 search results - page 262 / 876 » Mass problems and randomness |
162
click to vote
EOR
2006
15 years 6 months ago
2006
In this paper, we develop an acyclic network of queues for the design of a dynamic flow shop, where each service station represents a machine. The orders arrive at the input stati...
135
click to vote
CP
2000
Springer
15 years 11 months ago
2000
Springer
We perform a comprehensive theoretical and empirical study of the benefits of singleton consistencies. Our theoretical results help place singleton consistencies within the hierar...
202
click to vote
PAIRING
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Efficient non-interactive zero-knowledge proofs are a powerful tool for solving many cryptographic problems. We apply the recent Groth-Sahai (GS) proof system for pairing...
222
click to vote
CEC
2008
IEEE
16 years 1 months ago
2008
IEEE
— Quasirandom or low discrepancy sequences, such as the Van der Corput, Sobol, Faure, Halton (named after their inventors) etc. are less random than a pseudorandom number sequenc...
161
Voted
RANDOM
2001
Springer
15 years 11 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...