4276 search results - page 479 / 856 » Computability of Probability Distributions and Distribution ... |
181
click to vote
SPAA
2003
ACM
15 years 12 months ago
2003
ACM
In a (randomized) oblivious routing scheme the path chosen for a request between a source s and a target t is independent from the current traffic in the network. Hence, such a sc...
180
click to vote
SPAA
2010
ACM
15 years 7 months ago
2010
ACM
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
177
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
205
click to vote
EMMCVPR
2003
Springer
15 years 12 months ago
2003
Springer
The asymptotic distribution of estimates that are based on a sub-optimal search for the maximum of the log-likelihood function is considered. In particular, estimation schemes that...
170
click to vote
HPDC
1999
IEEE
15 years 11 months ago
1999
IEEE
Process checkpointing is a basic mechanism required for providing High Throughput Computing service on distributively owned resources. We present a new process checkpoint and migr...