Results 251 to 260 of about 451,378 (309)
O prislovih z orodniškim obrazilom v sodobnih slovanskih jezikih
Boris Markov
doaj
Convergence Rate of Euler-Maruyama Scheme to the Invariant Probability Measure Under Total Variation Distance for the SDEs. [PDF]
Wang Y, Ye Y.
europepmc +1 more source
Large deviations of piecewise-deterministic Markov processes with application to stochastic calcium waves. [PDF]
Barbet G +3 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
SIAM Journal on Computing, 1992
This paper considers the problem of paging under the assumption that the sequence of pages accessed is generated by a Markov chain. We use this model to study the fault-rate of paging algorithms. We first draw on the theory of Markov decision processes to characterize the paging algorithm that achieves optimal fault-rate on any Markov chain.
Anna R. Karlin +2 more
openaire +2 more sources
This paper considers the problem of paging under the assumption that the sequence of pages accessed is generated by a Markov chain. We use this model to study the fault-rate of paging algorithms. We first draw on the theory of Markov decision processes to characterize the paging algorithm that achieves optimal fault-rate on any Markov chain.
Anna R. Karlin +2 more
openaire +2 more sources
Markov and Markov-Regenerative
This paper investigates pert networks with independent and exponentially distributed activity durations. We model such networks as finite-state, absorbing, continuous-time Markov chains with upper triangular generator matrices. The state space is related to the network structure.
Vidyadhar G. Kulkarni, Veena G. Adlakha
openaire +1 more source
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011
Consider the problem of laying out a set of $n$ images that match a query onto the nodes of a $\sqrt{n}\times\sqrt{n}$ grid. We are given a score for each image, as well as the distribution of patterns by which a user's eye scans the nodes of the grid and we wish to maximize the expected total score of images selected by the user.
CHIERICHETTI, FLAVIO +2 more
openaire +1 more source
Consider the problem of laying out a set of $n$ images that match a query onto the nodes of a $\sqrt{n}\times\sqrt{n}$ grid. We are given a score for each image, as well as the distribution of patterns by which a user's eye scans the nodes of the grid and we wish to maximize the expected total score of images selected by the user.
CHIERICHETTI, FLAVIO +2 more
openaire +1 more source

