DocumentCode :
2991603
Title :
Algorithms for approximating the performance of multimode systems
Author :
Shier, D.R. ; Bibelnieks, E. ; Jarvis, J.P. ; Lakin, R.J.
Author_Institution :
Dept. of Math., Coll. of William & Mary, Williamsburg, VA, USA
fYear :
1990
fDate :
3-7 Jun 1990
Firstpage :
741
Abstract :
The empirical performance of state enumeration methods proposed by several authors are examined, and refinements which result in significant computational improvements are presented. Two methods for state enumeration which compare favorably with the most efficient of current methods are introduced. They are based respectively on the work of S.-N. Chiou and V.O.K. Li (1986) and R.F. Gaebler and R.J. Chen (1987). It is shown that every algorithm discussed except that of C.L. Yang and P. Kubar (1989) can be executed significantly faster when the state enumeration problem is somewhat relaxed
Keywords :
system theory; algorithms; multimode systems; network reliability; performance approximation; state enumeration methods; Communication networks; Educational institutions; Mathematics; Polynomials; Power system reliability; State-space methods; Telecommunication network reliability; Terminology; Tin; Tires;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
INFOCOM '90, Ninth Annual Joint Conference of the IEEE Computer and Communication Societies. The Multiple Facets of Integration. Proceedings, IEEE
Conference_Location :
San Francisco, CA
Print_ISBN :
0-8186-2049-8
Type :
conf
DOI :
10.1109/INFCOM.1990.91317
Filename :
91317
Link To Document :
بازگشت