메뉴 건너뛰기




Volumn 134, Issue 1, 2005, Pages 101-118

The cross-entropy method for network reliability estimation

Author keywords

Cross entropy; Importance sampling; Merge process; Network reliability; Permutation Monte Carlo; Rare events

Indexed keywords


EID: 17444417821     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-005-5726-x     Document Type: Article
Times cited : (85)

References (35)
  • 1
    • 17444384857 scopus 로고    scopus 로고
    • Application of the cross-entropy method to the buffer allocation problem in a simulation-based environment
    • Alon, G., D.P. Kroese, T. Raviv, and R.Y. Rubinstein. (2005). "Application of the Cross-Entropy Method to the Buffer Allocation Problem in a Simulation-Based Environment." Annals of Operations Research 134, 137-151.
    • (2005) Annals of Operations Research , vol.134 , pp. 137-151
    • Alon, G.1    Kroese, D.P.2    Raviv, T.3    Rubinstein, R.Y.4
  • 2
    • 0000641118 scopus 로고
    • Bounds for distributions with monotone hazard rate, I and II
    • Barlow, R. and A. Marshall. (1964). "Bounds for Distributions with Monotone Hazard Rate, I and II." Ann. Maths. Statist. 35, 1234-1274.
    • (1964) Ann. Maths. Statist. , vol.35 , pp. 1234-1274
    • Barlow, R.1    Marshall, A.2
  • 4
    • 17444409408 scopus 로고
    • Asymptotic estimates of the reliability of a complex system
    • Burtin, Y. and B. Pittel. (1972). "Asymptotic Estimates of the Reliability of a Complex System." Engrg. Cybern. 10(3), 445-451.
    • (1972) Engrg. Cybern. , vol.10 , Issue.3 , pp. 445-451
    • Burtin, Y.1    Pittel, B.2
  • 6
    • 0037883114 scopus 로고
    • Evaluating performability: Most probable states and bounds
    • Colbourn, C. and D. Harms. (1994). "Evaluating performability: Most probable states and bounds." Telecommunication Systems 2, 275-300.
    • (1994) Telecommunication Systems , vol.2 , pp. 275-300
    • Colbourn, C.1    Harms, D.2
  • 9
    • 0012352350 scopus 로고    scopus 로고
    • Adaptive state-dependent importance sampling simulation of markovian queueing networks
    • de Boer, P.T. and V.F. Nicola. (2002). "Adaptive State-Dependent Importance Sampling Simulation of Markovian Queueing Networks." European Transactions on Telecommunications 13(4), 303-315.
    • (2002) European Transactions on Telecommunications , vol.13 , Issue.4 , pp. 303-315
    • De Boer, P.T.1    Nicola, V.F.2
  • 11
    • 3242883001 scopus 로고    scopus 로고
    • A fast cross-entropy method for estimating buffer overflows in queueing networks
    • de Boer, P. T., D.P. Kroese, and R.Y. Rubinstein. (2004). "A Fast Cross-Entropy Method for Estimating Buffer Overflows in Queueing Networks." Management Science 50(7), 883-895.
    • (2004) Management Science , vol.50 , Issue.7 , pp. 883-895
    • De Boer, P.T.1    Kroese, D.P.2    Rubinstein, R.Y.3
  • 14
    • 0019007037 scopus 로고
    • Sequential destruction method for Monte Carlo evaluation of system reliability
    • Easton, M. and C. Wong. (1980). "Sequential Destruction Method for Monte Carlo Evaluation of System Reliability." IEEE Transactions on Reliability R-29, 27-32.
    • (1980) IEEE Transactions on Reliability , vol.R-29 , pp. 27-32
    • Easton, M.1    Wong, C.2
  • 15
  • 17
    • 0001382704 scopus 로고
    • Association of random variables, with applications
    • Esary, J.D., F. Proschan, and D.W. Walkup. (1967). "Association of Random Variables, with Applications." Ann. math. Statist. 38, 1466-1474.
    • (1967) Ann. Math. Statist. , vol.38 , pp. 1466-1474
    • Esary, J.D.1    Proschan, F.2    Walkup, D.W.3
  • 18
    • 0022745801 scopus 로고
    • A Monte Carlo sampling plan for estimating network reliability
    • Fishman, G. (1986). "A Monte Carlo Sampling Plan for Estimating Network Reliability." Operations Research 34(4), 581-594.
    • (1986) Operations Research , vol.34 , Issue.4 , pp. 581-594
    • Fishman, G.1
  • 23
  • 28
    • 84901401227 scopus 로고    scopus 로고
    • Cross entropy guided ant-like agents finding dependable primary/backup path patterns in networks
    • Honolulu, Hawaii, IEEE
    • Wittner O. and B.E. Helvik (2002). "Cross Entropy Guided Ant-like Agents Finding Dependable Primary/Backup Path Patterns in Networks." In Proceedings of Congress on Evolutionary Computation (CEC2002), Honolulu, Hawaii, IEEE.
    • (2002) Proceedings of Congress on Evolutionary Computation (CEC2002)
    • Wittner, O.1    Helvik, B.E.2
  • 29
    • 0000166629 scopus 로고
    • The complexity of counting cuts and of computing the probability that a graph is connected
    • Provan, J. and M. Ball. (1982). "The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected." SIAM Journal of Computing 12, 777-787.
    • (1982) SIAM Journal of Computing , vol.12 , pp. 777-787
    • Provan, J.1    Ball, M.2
  • 32
    • 0031139210 scopus 로고    scopus 로고
    • Optimization of computer simulation models with rare events
    • Rubinstein, R.Y. (1997). "Optimization of Computer Simulation Models with Rare Events." European Journal of Operations Research 99, 89-112.
    • (1997) European Journal of Operations Research , vol.99 , pp. 89-112
    • Rubinstein, R.Y.1
  • 33
    • 0000228665 scopus 로고    scopus 로고
    • The cross-entropy method for combinatorial and continuous optimization
    • Rubinstein, R.Y. (1999). "The Cross-Entropy Method for Combinatorial and Continuous Optimization." Methodology and Computing in Applied Probability 2, 127-190.
    • (1999) Methodology and Computing in Applied Probability , vol.2 , pp. 127-190
    • Rubinstein, R.Y.1
  • 34
    • 0012307417 scopus 로고    scopus 로고
    • Combinatorial optimization, cross-entropy, ants and rare events
    • S. Uryasev and P.M. Pardalos (eds.), Kluwer
    • Rubinstein, R.Y. (2001). "Combinatorial Optimization, Cross-Entropy, Ants and Rare Events." In S. Uryasev and P.M. Pardalos (eds.), Stochastic Optimization: Algorithms and Applications, Kluwer, pp. 304-358.
    • (2001) Stochastic Optimization: Algorithms and Applications , pp. 304-358
    • Rubinstein, R.Y.1
  • 35
    • 0012303220 scopus 로고    scopus 로고
    • The cross-entropy method and rare-events for maximal cut and bipartition problems
    • Rubinstein, R.Y. (2002). "The Cross-Entropy Method and Rare-Events for Maximal Cut and Bipartition Problems." ACM Transactions on Modelling and Computer Simulation 12(1), 303-315.
    • (2002) ACM Transactions on Modelling and Computer Simulation , vol.12 , Issue.1 , pp. 303-315
    • Rubinstein, R.Y.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.