[图书][B] Smoothing, filtering and prediction: Estimating the past, present and future
G Einicke - 2012 - books.google.com
This book describes the classical smoothing, filtering and prediction techniques together
with some more recently developed embellishments for improving performance within …
with some more recently developed embellishments for improving performance within …
Parallel iterative solution method for large sparse linear equation systems
R Mehmood, J Crowcroft - 2005 - cl.cam.ac.uk
Solving sparse systems of linear equations is at the heart of scientific computing. Large
sparse systems often arise in science and engineering problems. One such problem we …
sparse systems often arise in science and engineering problems. One such problem we …
Symbolic representations and analysis of large probabilistic systems
This paper describes symbolic techniques for the construction, representation and analysis
of large, probabilistic systems. Symbolic approaches derive their efficiency by exploiting …
of large, probabilistic systems. Symbolic approaches derive their efficiency by exploiting …
Analysis of on-off policies in sensor networks using interacting markovian agents
M Gribaudo, D Cerotti, A Bobbio - 2008 Sixth Annual IEEE …, 2008 - ieeexplore.ieee.org
Power management in battery operated sensor networks, is a hot topic addressed by many
ongoing researches. One of the most commonly employed technique consists in turning on …
ongoing researches. One of the most commonly employed technique consists in turning on …
Approximate lumpability for Markovian agent-based models using local symmetries
We study a Markovian agent-based model (MABM) in this paper. Each agent is endowed
with a local state that changes over time as the agent interacts with its neighbours. The …
with a local state that changes over time as the agent interacts with its neighbours. The …
[PDF][PDF] Disk-based techniques for efficient solution of large Markov chains
R Mehmood - 2005 - researchgate.net
Computer systems are ubiquitous in almost all spheres of our life, motivating the need for
them to function correctly and in a timely manner. Continuous time Markov chains (CTMCs) …
them to function correctly and in a timely manner. Continuous time Markov chains (CTMCs) …
Exact analysis of summary statistics for continuous-time discrete-state Markov processes on networks using graph-automorphism lumping
JA Ward, M López-García - Applied Network Science, 2019 - Springer
We propose a unified framework to represent a wide range of continuous-time discrete-state
Markov processes on networks, and show how many network dynamics models in the …
Markov processes on networks, and show how many network dynamics models in the …
Stochastic Petri nets with matrix exponentially distributed firing times
P Buchholz, M Telek - Performance Evaluation, 2010 - Elsevier
There are widely used analysis techniques for stochastic Petri nets with phase type (PH)
distributed firing times. These techniques are based on the generation of an expanded …
distributed firing times. These techniques are based on the generation of an expanded …
A kronecker algebra formulation for markov activity networks with phase-type distributions
The application of theoretical scheduling approaches to the real world quite often crashes
into the need to cope with uncertain events and incomplete information. Stochastic …
into the need to cope with uncertain events and incomplete information. Stochastic …
Saturation for a general class of models
AS Miner - IEEE Transactions on Software Engineering, 2006 - ieeexplore.ieee.org
Implicit techniques for construction and representation of the reachability set of a high-level
model have become quite efficient for certain types of models. In particular, previous work …
model have become quite efficient for certain types of models. In particular, previous work …