JSSPP
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. In order to evaluate different scheduling strategies for parallel computers, simulations are often executed. As the scheduling quality highly depends on the workload tha...
ICGI
2004
Springer
13 years 10 months ago
2004
Springer
We present a method for modeling user navigation on a web site using grammatical inference of stochastic regular grammars. With this method we achieve better models than the previo...
FSTTCS
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Monolithic finite-state probabilistic programs have been abstractly modeled by finite Markov chains, and the algorithmic verification problems for them have been inves...
COLT
2004
Springer
13 years 10 months ago
2004
Springer
We define the problem of inferring a “mixture of Markov chains” based on observing a stream of interleaved outputs from these chains. We show a sharp characterization of the i...
STACS
2005
Springer
13 years 10 months ago
2005
Springer
We introduce and study Recursive Markov Chains (RMCs), which extend ordinary finite state Markov chains with the ability to invoke other Markov chains in a potentially recursive m...
FCT
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We analyse the mixing time of Markov chains using path coupling with stopping times. We apply this approach to two hypergraph problems. We show that the Glauber dynamics ...
QEST
2005
IEEE
13 years 10 months ago
2005
IEEE
We consider bisimulation and weak bisimulation relations in the context of the Labeled Markov Chains of Hansson and Jonsson, the Concurrent Labeled Markov Chains of Philippou, Lee...
QEST
2006
IEEE
13 years 10 months ago
2006
IEEE
We consider discrete infinite-state Markov chains which contain an eager finite attractor. A finite attractor is a finite subset of states that is eventually reached with prob...
FOCS
2006
IEEE
13 years 10 months ago
2006
IEEE
We study a switch Markov chain on regular graphs, where switches are allowed only between links that are at distance 3; we call this the Flip. The motivation for studying the Flip...
IJCNN
2007
IEEE
13 years 11 months ago
2007
IEEE
–The performability of disk arrays systems has been studied before. However, in the case of imprecise data, a fuzzy model can be the base for the performability analysis. This pa...