Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Computer Sciences
Indifference Graphs And The Single Row Routing Problem, Peter J. Looges
Indifference Graphs And The Single Row Routing Problem, Peter J. Looges
Computer Science Theses & Dissertations
This thesis investigates the subclass of interval graphs known as indifference graphs. New optimal algorithms for recognition, center, diameter, maximum matching, Hamiltonian path and domination in indifference graphs are presented. The recognition algorithm produces a linear order with properties which allow the solution of the other problems in linear time. Indifference graphs are further applied to the single row routing problem which results in both sequential,. and parallel routing algorithms.
Estimation In A Marked Poisson Error Recapture Model Of Software Reliability, Rajan Gupta
Estimation In A Marked Poisson Error Recapture Model Of Software Reliability, Rajan Gupta
Mathematics & Statistics Theses & Dissertations
Nayak's (1988) model for the detection, removal, and recapture of the errors in a computer program is extended to a larger family of models in which the probabilities that the successive programs produce errors are described by the tail probabilities of discrete distribution on the positive integers. Confidence limits are derived for the probability that the final program produces errors. A comparison of the asymptotic variances of parameter estimates given by the error recapture and by the repetitive-run procedure of Nagel, Scholz, and Skrivan (1982) is made to determine which of these procedures efficiently uses the test time.