Articles de revista: Enviaments recents
Ara es mostren els items 13-24 de 47
-
Reliability bounds for fault-tolerant systems with deferred repair using bounding split regenerative randomization
(2013-08)
Article
Accés obertA numerically stable method is developed which computes seemingly tight bounds at a small computational cost relative to the model size, when that model size is large, for the unreliability and bounds for the unreliability ... -
Transient analysis of large Markov models with absorbing states using regenerative randomization
(2005-10)
Article
Accés obertIn this article, we develop a new method, called regenerative randomization, for the transient analysis of continuous time Markov models with absorbing states. The method has the same good properties as standard ... -
Una propuesta de evaluación de competencias genéricas en grados de Ingeniería
(Red Estatal de Docencia Universitaria, 2013-10-01)
Article
Accés obertIn genetic association studies, tests for Hardy-Weinberg proportions are often employed as a quality control checking procedure. Missing genotypes are typically discarded prior to testing. In this paper we show that inference ... -
Tight upper bounds for the expected loss of lexicographic heuristics in binary multiattribute choice
(North Holland Mathematical Library, 2008-03)
Article
Accés obertTight upper bounds for the expected loss of the DEBA (Deterministic-Elimination-By-Aspects) lexicographic selection heuristic are obtained for the case of an additive separable utility function with unknown non-negative, ... -
Combinatorial methods for the evaluation of yield and operational reliability of fault-tolerant systems-on-chip
(2004-02)
Article
Accés obertIn this paper we develop combinatorial methods for the evaluation of yield and operational reliability of fault-tolerant systems-on-chip. The method for yield computation assumes that defects are produced according to a ... -
Two methods for computing bounds for the distribution of cumulative reward for large Markov models
(2006-12)
Article
Accés obertDegradable fault-tolerant systems can be evaluated using rewarded continuous-time Markov chain (CTMC) models. In that context, a useful measure to consider is the distribution of the cumulative reward over a time interval ... -
Numerical iterative methods for Markovian dependability and performability models: new results and a comparison
(2000-02)
Article
Accés obertIn this paper we deal with iterative numerical methods to solve linear systems arising in continuous-time Markov chain (CTMC) models. We develop an algorithm to dynamically tune the relaxation parameter of the successive ... -
Tight steady-state availability bounds using the failure distance concept
(1998-09)
Article
Accés obertContinuous-time Markov chains are commonly used for dependability modeling of repairable fault-tolerant computer systems. Realistic models of non-trivial fault-tolerant systems often have very large state spaces. An ... -
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 ... -
Solving large interval availability models using a model transformation approach
(2004-05)
Article
Accés obertFault-tolerant systems are often modeled using (homogeneous) continuous time Markovchains (CTMCs). Computation of the distribution of the interval availability, i.e. of the distribution of the fraction of time in a time ... -
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 ... -
Efficient exploration of availability models guided by failure distances
(1996-05)
Article
Accés obertRecently, a method to bound the steady-state availability using the failure distance concept has been proposed. In this paper we refine that method by introducing state space exploration techniques. In the methods proposed ...