490 search results - page 61 / 98 » Abstraction Augmented Markov Models |
86
Voted
INFOCOM
2003
IEEE
15 years 3 months ago
2003
IEEE
Abstract— Replacement policies for general caching applications and Web caching in particular have been discussed extensively in the literature. Many ad-hoc policies have been pr...
INFOCOM
2003
IEEE
15 years 3 months ago
2003
IEEE
Abstract— We investigate a widely popular Least-RecentlyUsed (LRU) cache replacement algorithm with semi-Markov modulated requests. Semi-Markov processes provide the flexibility...
SBMF
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. In the verification of concurrent systems involving probabilities, the aim is to find out the maximum/minimum probability that a given event occurs (examples of such ev...
87
Voted
SPIRE
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. A set of sequences S is pairwise bounded if the Hamming distance between any pair of sequences in S is at most 2d. The Consensus Sequence problem aims to discern between ...
104
click to vote
WCNC
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract—In cognitive mobile multihop relay (CMMR) network, the mobile user as the primary user is allocated with the channel for transmitting data. Relay station as the secondar...