5055 search results - page 390 / 1011 » Relative Timing |
170
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
It is a longstanding open problem to devise an oracle relative to which BQP does not lie in the Polynomial-Time Hierarchy (PH). We advance a natural conjecture about the capacity ...
197
click to vote
PPSN
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Evolutionary algorithms have been shown to be very successful for a wide range of NP-hard combinatorial optimization problems. We investigate the NP-hard problem of compu...
233
click to vote
MIR
2005
ACM
16 years 1 months ago
2005
ACM
Concept drifting is an important and challenging research issue in the field of machine learning. This paper mainly addresses the issue of semantic concept drifting in time series...
205
Voted
ICCD
2007
IEEE
16 years 4 months ago
2007
IEEE
Microarchitectural simulation is orders of magnitude slower than native execution. As more elements are accurately modeled, problems associated with slow simulation are further ex...
198
Voted
RTSS
1998
IEEE
15 years 11 months ago
1998
IEEE
In this paper, we derive a statistical delay guarantee of the generalized Virtual Clock scheduling algorithm. We define the concept of an equivalent fluid and packet source and pr...