Results 251 to 260 of about 440,340 (303)

Markov Paging

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, Steven J. Phillips, Prabhakar Raghavan   +2 more
openaire   +2 more sources

Markov and Markov-Regenerative pert Networks

Operations Research, 1986
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

Markov Measures and Markov Extensions

Theory of Probability & Its Applications, 1963
Let ${\bf \mathfrak{K}}$ be a complex with the set of vertices M and A, B and R three subsets of M. R is said to be separating A and B in ${\bf \mathfrak{K}}$ (notation: $(A\mathop |\limits_R B)\mathfrak{K}$ if any $a \in A$ and $b \in B$ are not connected in $ \mathfrak{K} - \cup _{r \in R} O_\mathfrak{K} r$ is the star of r in $\mathfrak{K}$.Let $S_a
openaire   +2 more sources

Markov Duels

Operations Research, 1974
Markov duels are a general class of stochastic duels in which each weapon has Markov-dependent fire, that is, the outcomes of shots by each weapon form a Markov process. This paper develops duel models for the situation in which the outcomes form a finite stationary Markov chain and both weapons have an unlimited supply of ammunition, fire at constant
openaire   +3 more sources

Markov Layout

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, Ravi Kumar, Raghavan Prabhakar   +2 more
openaire   +1 more source

Markov or not Markov - this should be a question [PDF]

, 2001
Although it is well known that Markov process theory, frequently applied in the literature on income convergence, imposes some very restrictive assumptions upon the data generating process, these assumptions have generally been taken for granted so far. The present paper proposes, resp.
Bode, Eckhardt, Bickenbach, Frank
openaire   +3 more sources

Markov and Semi-Markov Processes

2018
This chapter is devoted to jump Markov processes and finite semi-Markov processes. In both cases, the index is considered as the calender time, continuously counted over the positive real line. Markov processes are continuous-time processes that share the Markov property with the discrete-time Markov chains.
Valérie Girardin, Nikolaos Limnios
openaire   +1 more source

Markov Functionals of an Ergodic Markov Process

Theory of Probability & Its Applications, 1995
Let \((X(t), t \geq 0)\) be a homogeneous Markov process. The author calls a random process \(\xi(t)\) the Markovian functional if the pair \((X(t), \xi(t))\) is a homogeneous Markov process. Let \(\xi_n (t)\) be a sequence of Markovian functionals with finite state space \(I = \{1,2,\dots, d\}\) for all \(n \geq 1\) and such that the following ...
openaire   +2 more sources