230 search results - page 2 / 46 » Quantum Search with Variable Times |
SIGMETRICS
2008
ACM
13 years 5 months ago
2008
ACM
We consider the round robin (RR) scheduling policy where the server processes each job in its buffer for at most a fixed quantum, q, in a round-robin fashion. The processor sharin...
AAAI
2012
11 years 7 months ago
2012
This paper concerns learning and prediction with probabilistic models where the domain sizes of latent variables have no a priori upper-bound. Current approaches represent prior d...
UC
2005
Springer
13 years 10 months ago
2005
Springer
Consider a database most of whose entries are marked but the precise fraction of marked entries is not known. What is known is that the fraction of marked entries is 1 − , where ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We calculate median adiabatic times (in seconds) of a specific superconducting adiabatic quantum processor for an NP-hard Ising spin glass instance class with up to N = 128 binary ...
HM
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. In this work we extend a VNS for the periodic vehicle routing problem with time windows (PVRPTW) to a multiple VNS (mVNS) where several VNS instances are applied cooperat...