1640 search results - page 103 / 328 » Conditional Independence Trees |
114
click to vote
IPPS
2003
IEEE
15 years 8 months ago
2003
IEEE
In this paper, we consider the problem of scheduling independent identical tasks on heterogeneous processors where communication times and processing times are different. We assum...
115
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. We study in this paper an M/M/1 queue whose server rate depends upon the state of an independent Ornstein-Uhlenbeck diffusion process (X(t)) so that its value at time t i...
111
click to vote
COMBINATORICA
2000
15 years 3 months ago
2000
Suppose t1, ..., tn are independent random variables which take value either 0 or 1, and Y is a multi-variable polynomial in ti's with positive coefficients. We give a conditi...
120
Voted
QUESTA
2002
15 years 3 months ago
2002
We consider a queue fed by Gaussian traffic and give conditions on the input process under which the path space large deviations of the queue are governed by the rate function of t...
102
click to vote
ECCC
2010
15 years 1 months ago
2010
We initiate the study of the proof complexity of propositional encoding of (weak cases of) concrete independence results. In particular we study the proof complexity of Paris-Harr...