3208 search results - page 276 / 642 » A Lower Bound for Primality |
177
click to vote
MFCS
2010
Springer
15 years 5 months ago
2010
Springer
We study observation-based strategies for partially-observable Markov decision processes (POMDPs) with parity objectives. An observationbased strategy relies on partial information...
169
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
In terabit-density magnetic recording, several bits of data can be replaced by the values of their neighbors in the storage medium. As a result, errors in the medium are dependent ...
180
click to vote
JGO
2010
15 years 1 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
194
click to vote
SIAMNUM
2010
15 years 1 months ago
2010
We derive a posteriori error estimates for the discretization of the heat equation in a unified and fully discrete setting comprising the discontinuous Galerkin, finite volume, mix...
194
click to vote
MOBIHOC
2012
ACM
13 years 9 months ago
2012
ACM
In this paper, we characterize the throughput of a broadcast network with n receivers using rateless codes with block size K. We assume that the underlying channel is a Markov mod...