Sciweavers

SIMVIS
2004
13 years 5 months ago
A Multi-Level Method for the Steady State Solution of Markov Chains
This paper illustrates the current state of development of an algorithm for the steady state solution of continuous-time Markov chains. The so-called multi-level algorithm utilize...
Claudia Isensee, Graham Horton
IADIS
2003
13 years 5 months ago
Using Combined Markov Chains to Predict WWW Navigation Paths
The Internet network provides access to several hundreds of million sites and expands at a rate of a million pages a day. Yet, given the rapid and anarchical nature of its evoluti...
Y. Hafri
DAGSTUHL
2006
13 years 5 months ago
How fast does the stationary distribution of the Markov chain modelling EAs concentrate on the homogeneous populations for small
One of the main difficulties faced when analyzing Markov chains modelling evolutionary algorithms is that their cardinality grows quite fast. A reasonable way to deal with this iss...
Boris Mitavskiy, Jonathan E. Rowe
UAI
2008
13 years 5 months ago
Sensitivity analysis for finite Markov chains in discrete time
When the initial and transition probabilities of a finite Markov chain in discrete time are not well known, we should perform a sensitivity analysis. This is done by considering a...
Gert De Cooman, Filip Hermans, Erik Quaeghebeur
SYRCODIS
2008
95views Database» more  SYRCODIS 2008»
13 years 5 months ago
The Framework for Study Of Caching Algorithm Efficiency
In this paper we offer several models of reference sequences (traces of references) using Markov chains for testing of the replacement policies in caching systems. These models en...
Michael V. Grankov, Ngo Thanh Hung, Mosab Bassam Y...
DAGSTUHL
2007
13 years 6 months ago
Convergence of iterative aggregation/disaggregation methods based on splittings with cyclic iteration matrices
Iterative aggregation/disaggregation methods (IAD) belong to competitive tools for computation the characteristics of Markov chains as shown in some publications devoted to testing...
Ivo Marek, Ivana Pultarová, Petr Mayer
DSN
2005
IEEE
13 years 6 months ago
Combining Response Surface Methodology with Numerical Models for Optimization of Class-Based Queueing Systems
In general, decision support is one of the main purposes of model-based analysis of systems. Response surface methodology (RSM) is an optimization technique that has been applied ...
Peter Kemper, Dennis Müller, Axel Thümml...
MMB
2010
Springer
185views Communications» more  MMB 2010»
13 years 6 months ago
Correctness Issues of Symbolic Bisimulation Computation for Markov Chains
Abstract. Bisimulation reduction is a classical means to fight the infamous state space explosion problem, which limits the applicability of automated methods for verification li...
Ralf Wimmer, Bernd Becker
ICALP
2000
Springer
13 years 8 months ago
Temporal Rewards for Performance Evaluation
Today many formalisms exist for specifying complex Markov chains. In contrast, formalism for specifying the quantitative properties to analyze have remained quite primitive. In th...
Jeroen Voeten
ICALP
2000
Springer
13 years 8 months ago
Amalgamation of Transition Sequences in the PEPA Formalism
This report presents a formal approach to reducing sequences in PEPA components. Performing the described amalgamation procedure we may remove, from the underlying Markov chain, t...
Jane Hillston, J. Tomasik