Edmundo De Souza E. Silva

Edmundo De Souza E. Silva

Auto-generated profile, based on publicly available information

Edmundo De Souza E. Silva

UFRJ

Research Focus & Metrics

Academic Career Length

40Years (1987-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 1989 in Journal of the ACM
Verified
Journal Article
Open access
ESEdmundo de Souza e Silva
Edmundo de Souza e Silva
HGH. Richard Gail
H. Richard Gail
Repairable computer systems are considered, the availability behavior of which can be modeled as a homogeneous Markov process. The randomization method is used to calculate various measures over a finite observation period related to availability modeling of these systems. These measures include the distribution of the number of events of a certain type, the distribution of the length of time in a set of states, and the probability of a near-coincident fault. The method is then extended to calculate performability distributions. The method relies on coloring subintervals of the finite observation period based on the particular application, and then calculating the measure of interest using these colored intervals.

1 November 2010 in Energy Economics
Verified
Journal Article
Closed access
ESEdmundo G. de Souza e Silva
Edmundo G. de Souza e Silva
LLLuiz F.L. Legey
Luiz F.L. Legey
ESEdmundo A. de Souza e Silva
Edmundo A. de Souza e Silva

1 January 1989 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
RMR.R. Muntz
R.R. Muntz
ESE. De Souza e Silva
E. De Souza e Silva
AGA. Goyal
A. Goyal

1 January 1998 in Communications in Statistics. Stochastic Models
Verified
Journal Article
Closed access
ESEdmundo de Souza e Silva
Edmundo de Souza e Silva
HGH. Richard Gail
H. Richard Gail
Markov reward models have been used to solve a wide variety of problems. In these models, reward rates are associated to the states of a continuous time Markov chain, and impulse rewards are associated to transitions of the chain. Rate based rewards are gained per unit time in the associated state, while impulse rewards are gained instantaneously each time certain transitions occur. We develop an efficient algorithm to calculate the distribution of the total accumulated reward over a given interval of time when both rate and impulse rewards are present. As special cases, we obtain an algorithm to handle models for which only rate rewards occur and another algorithm for the case when only impulse rewards are present. The development is based purely on probabilistic arguments, and the recursions obtained are simple and have a low computational cost.

1 February 1992 in Performance Evaluation
Verified
Journal Article
Closed access
ESEdmundo de Souza e Silva
Edmundo de Souza e Silva
HGH. Richard Gail
H. Richard Gail

1 April 2008 in Computer Networks
Verified
Journal Article
Closed access
ASAna Paula Couto da Silva
Ana Paula Couto da Silva
MVMartín Varela
Martín Varela
ESEdmundo de Souza e Silva
Edmundo de Souza e Silva
RLRosa M.M. Leão
Rosa M.M. Leão
GRGerardo Rubino
Gerardo Rubino