Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Raymond Kanyangarara

dblp:271/2206 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1982
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation › queueing models › single server queue
m/g/1 queue
0.011982
Skinner's Method for Computing Bounds on Distributions and the Numerical Solution of Continuous-Time Queueing Problems · IEEE Trans. Commun. 1982
Performance modeling and evaluation
queueing models
0.011982
Skinner's Method for Computing Bounds on Distributions and the Numerical Solution of Continuous-Time Queueing Problems · IEEE Trans. Commun. 1982
Performance modeling and evaluation › queueing analysis
waiting time distribution
0.011982
Skinner's Method for Computing Bounds on Distributions and the Numerical Solution of Continuous-Time Queueing Problems · IEEE Trans. Commun. 1982

Methods — techniques the papers use, named apart from their topics

wiener-hopf factorization · 0.0convolution of probability density functions · 0.0
YearPublicationVenuePosition
1982 Skinner's Method for Computing Bounds on Distributions and the Numerical Solution of Continuous-Time Queueing Problems
abstract
Skinner's method provides a means of computing; numerically, upper and lower bounds on a cumulative distribution function resulting from the convolution of probability density functions. The method thus provides approximate numerical results whose accuracy is known precisely. This paper provides an exposition of Skinner's method. It shows how the method Can be applied to the computation of numerical solutions of other problems, as well as the waiting time distribution of theM/G/1queue, for which Skinner presented the method.
Martin H. Ackroyd, Raymond Kanyangarara
IEEE Trans. Commun.2