Fast Sequential Importance Sampling to Estimate the Graph Reliability Polynomial

Author： Harris David   Sullivan Francis   Beichl Isabel  

Publisher： Springer Publishing Company

ISSN： 0178-4617

Source： Algorithmica, Vol.68, Iss.4, 2014-04, pp. : 916-939

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Speeding up computation of the reliability polynomial coefficients for a random graph

By Rodionov A.  

Automation and Remote Control, Vol. 72, Iss. 7, 2011-07 ,pp. : 1474-1486

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Importance Sampling Simulations of Markovian Reliability Systems Using Cross-Entropy

By Ridder Ad  

Annals of Operations Research, Vol. 134, Iss. 1, 2005-02 ,pp. : 119-136

Springer Publishing Company

Access to resources Recommend Favorite

Power properties of NLC graph grammars with a polynomial membership problem

By Flasinski M.  

Theoretical Computer Science, Vol. 201, Iss. 1, 1998-07 ,pp. : 189-231

Elsevier

Access to resources Recommend Favorite

A fast randomized LOGSPACE algorithm for graph connectivity

By Feige U.  

Theoretical Computer Science, Vol. 169, Iss. 2, 1996-12 ,pp. : 147-160

Elsevier

Access to resources Recommend Favorite

Multidimensional sequential sampling for NURBs-based metamodel development

By Turner Cameron   Crawford Richard   Campbell Matthew  

Engineering with Computers, Vol. 23, Iss. 3, 2007-09 ,pp. : 155-174

Springer Publishing Company

Access to resources Recommend Favorite