Exploració per tema "Markov processes"
Ara es mostren els items 21-40 de 108
-
Bounding steady-state availability models with group repair and phase type repair distributions
(1999-05)
Article
Accés obertWe propose an algorithm to obtain bounds for the steady-state availability using Markov models in which only a small portion of the state space is generated. The algorithm is applicable to models with group repair and ... -
Bounding steady-state availability models with phase type repair distributions
(1998)
Comunicació de congrés
Accés obertWe propose a method to obtain bounds for the steady-state availability using Markov models in which only a small portion of the state space is generated. The method is applicable to models with phase type repair distributions ... -
Cadenas de Markov : métodos cuantitativos para la toma de decisiones III
(Universitat Politècnica de Catalunya. Iniciativa Digital Politècnica, 2016)
Llibre
Accés obertEsta obra forma parte de la colección Métodos cuantitativos para la toma de decisiones que, en su conjunto, permite resolver una amplia variedad de problemas. Cada volumen de esta colección desarrolla la técnica específica ... -
Characterisation of radio access network slicing scenarios with 5G QoS provisioning
(Institute of Electrical and Electronics Engineers (IEEE), 2020-03-13)
Article
Accés obert5G systems are envisaged to support a wide range of application scenarios with variate requirements. To handle this heterogeneity, 5G architecture includes network slicing capabilities that facilitate the partitioning of ... -
Closed form transient solution of continuous time Markov chains through uniformization
(Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering (ICST), 2013)
Comunicació de congrés
Accés obertThis paper derives a mapping between a close form transient solution of a continuous time Markov chain (CTMC), and a close form transient solution of one of its uniformized discrete time Markov chains. This result is used ... -
Comment on "Performability analysis: a new algorithm"
(2010-01)
Article
Accés obertThe paper “Performability Analysis: A New Algorithm” describes an algorithm for computing the complementary distribution of the accumulated reward over an interval of time in a homogeneous Markov process. In this comment, ... -
Comparación de la explicación obtenida con modelos de explicabilidad para diferentes métodos de Reinforcement Learning
(Universitat Politècnica de Catalunya, 2022-06-28)
Treball Final de Grau
Accés obertEl creciente uso de las tecnologías de Inteligencia Artificial para proveer productos y servicios destinados a humanos ha aumentado el interes en como estas tecnologías toman decisiones que pueden tener un grave impacto ... -
Computation of absorption probability distributions of continuous-time Markov chains using regenerative randomization
(Institute of Electrical and Electronics Engineers (IEEE), 1995)
Text en actes de congrés
Accés obertRandomization is a popular method for the transient solution of continuous-time Markov models. Its primary advantages over other methods (i.e., ODE solvers) are robustness and ease of implementation. It is however well-known ... -
Computation of Bounds for Transient Measures of Large Rewarded Markov Models using Regenerative Randomization
(2003-06)
Article
Accés obertIn this paper we generalize a method (called regenerative randomization) for the transient solution of continuous time Markov models. The generalized method allows to compute two transient measures (the expected transient ... -
Computing the expected Markov reward rates with stationarity detection and relative error control
(Kluwer Academic Publishers, 2016-03-11)
Article
Accés obertBy combining in a novel way the randomization method with the stationary detection technique, we develop two new algorithms for the computation of the expected reward rates of finite, irreducible Markov reward models, with ... -
Demisyllable-based HMM spotting for continuous speech recognition
(Institute of Electrical and Electronics Engineers (IEEE), 1991)
Text en actes de congrés
Accés obertThe authors describe the acoustic processor of a Spanish continuous speech recognition system based on demisyllable units. The acoustic processor is based on a spotting algorithm which takes as input the unknown utterance, ... -
Designing and modelling selective replication for fault-tolerant HPC applications
(Institute of Electrical and Electronics Engineers (IEEE), 2017)
Text en actes de congrés
Accés obertFail-stop errors and Silent Data Corruptions (SDCs) are the most common failure modes for High Performance Computing (HPC) applications. There are studies that address fail-stop errors and studies that address SDCs. However ... -
Disseny i validació d’un model predictiu de l’evolució de la borsa amb cadenes de Markov
(Universitat Politècnica de Catalunya, 2015-09)
Treball Final de Grau
Accés obertAquest treball tracta sobre les cadenes de Markov, més concretament aplicades a la borsa. En el primer punt es fa una breu introducció sobre què són i què fan els mercats financers, oferint algunes dades històriques i ... -
Efficient implementations of the randomization method with control of the relative error
(2005-05)
Article
Accés obertRandomization is a well-known numerical method for the transient analysis of continuous-time Markov chains. The main advantages of the method are numerical stability, well-controlled computation error and ability to specify ... -
Efficient transient simulation of failure/repair markovian models
(1991)
Text en actes de congrés
Accés obertSimulation methods have recently been developed for the solution of the extremely large Markovian dependability models which result from complex fault-tolerant computer systems. This paper presents efficient simulation ... -
Embeddability and rate identifiability of Kimura 2-parameter matrices
(2020-03-01)
Article
Accés obertDeciding whether a substitution matrix is embeddable (i.e. the corresponding Markov process has a continuous-time realization) is an open problem even for 4×4 matrices. We study the embedding problem and rate identifiability ... -
Embeddability of Kimura 3ST Markov matrices
(2018-05-14)
Article
Accés obertIn this note, we characterize the embeddability of generic Kimura 3ST Markov matrices in terms of their eigenvalues. As a consequence, we are able to compute the volume of such matrices relative to the volume of all Markov ... -
Empirical Time-Dimension Model of Spectrum Use Based on a Discrete-Time Markov Chain With Deterministic and Stochastic Duty Cycle Models
(2011-07)
Article
Accés restringit per política de l'editorialThe spectrum occupancy models widely used to date in dynamic spectrum access/cognitive radio (DSA/CR) research frequently rely on assumptions and oversimplifications that have not been validated with empirical measurement ... -
Equivalence between Non-Markovian and Markovian Dynamics in Epidemic Spreading Processes
(American Institute of Physics (AIP), 2017-03-24)
Article
Accés obertA general formalism is introduced to allow the steady state of non-Markovian processes on networks to be reduced to equivalent Markovian processes on the same substrates. The example of an epidemic spreading process is ... -
Expectation-maximization for evolutionary models
(Universitat Politècnica de Catalunya, 2023-06-29)
Treball Final de Grau
Accés obertPhylogenetics plays a crucial role in enhancing our understanding of molecular sequence evolution and is regarded as one of the most effective tools for studying the origin of contagious diseases. This thesis explores the ...