Results 231 to 240 of about 899,657 (289)
Double event-triggered fault tolerant consensus of nonlinear heterogeneous multiagent systems under inconsistent Markov. [PDF]
Sci RepHu D, Ma J, Zang S.
europepmc +1 more source
Higher-Order Markov Model-Based Analysis of Reinforcement Learning in 6G Mobile Retrial Queueing Systems. [PDF]
Sensors (Basel)Talbi D, Gal Z.
europepmc +1 more source
Global economic differences in modern glioblastoma care - a systematic review. [PDF]
Acta Neurochir (Wien)Christopher R +5 more
europepmc +1 more source
scGeno: a Hidden Markov Model approach to denoise chromosome-scale genotypes from single-cell data. [PDF]
Bioinform AdvTornisiello R, Kretzmer H.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
SIAM Journal on Computing, 1992
Summary: 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
Summary: 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