110 search results - page 9 / 22 » Chain polynomials and Tutte polynomials |
JSC
2006
13 years 7 months ago
2006
A Viterbi path of length n of a discrete Markov chain is a sequence of n + 1 states that has the greatest probability of ocurring in the Markov chain. We divide the space of all M...
IJFCS
2008
13 years 7 months ago
2008
We consider the equivalence problem for labeled Markov chains (LMCs), where each state is labeled with an observation. Two LMCs are equivalent if every finite sequence of observat...
BIRTHDAY
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Probabilistic systems of interacting intelligent agents are considered. They have two sources of uncertainty: uncertainty of communication channels and uncertainty of act...
STACS
2012
Springer
12 years 3 months ago
2012
Springer
Queueing networks are gaining attraction for the performance analysis of parallel computer systems. A Jackson network is a set of interconnected servers, where the completion of a...
INFOCOM
2012
IEEE
11 years 10 months ago
2012
IEEE
—In this paper we develop an adaptive learning algorithm which is approximately optimal for an opportunistic spectrum access (OSA) problem with polynomial complexity. In this OSA...