3229 search results - page 303 / 646 » The Theory of Timed Automata |
173
click to vote
SIGCOMM
2010
ACM
15 years 7 months ago
2010
ACM
We describe an opportunistic channel access scheme for cognitive radio-enabled secondary nodes (SNs). The proposed scheme uses the residual channel idle time distribution to estim...
157
click to vote
MA
2010
Springer
15 years 5 months ago
2010
Springer
The paper reconsiders the autoregressive aided periodogram bootstrap (AAPB) which has been suggested in Kreiß and Paparoditis (2003). Their idea was to combine a time domain param...
293
click to vote
SIAMCOMP
2011
14 years 9 months ago
2011
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
167
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
Identifying and controlling bias is a key problem in empirical sciences. Causal diagram theory provides graphical criteria for deciding whether and how causal effects can be iden...
185
click to vote
SIGMETRICS
2005
ACM
16 years 10 days ago
2005
ACM
We define the class of SMART scheduling policies. These are policies that bias towards jobs with small remaining service times, jobs with small original sizes, or both, with the ...