An efficient algorithm for rare-event probability estimation, combinatorial optimization, and counting (Q398785): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q56689537 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: RESTART / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11009-008-9073-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2055755416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to rare event simulation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3723577 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845258 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential Monte Carlo Methods in Practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cross-entropy method for continuous multi-extremal optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-stage nested partitions method for stochastic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact sampling with coupled Markov chains and applications to statistical mechanics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828566 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cross-entropy method for combinatorial and continuous optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stochastic minimum cross-entropy method for combinatorial optimization and rare-event estimation / rank
 
Normal rank
Property / cites work
 
Property / cites work: How many needles are in a haystack, or how to solve \#P-complete counting problems fast / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828558 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rare event restart simulation of two-stage networks / rank
 
Normal rank

Latest revision as of 21:30, 8 July 2024

scientific article
Language Label Description Also known as
English
An efficient algorithm for rare-event probability estimation, combinatorial optimization, and counting
scientific article

    Statements

    An efficient algorithm for rare-event probability estimation, combinatorial optimization, and counting (English)
    0 references
    0 references
    0 references
    15 August 2014
    0 references
    likelihood ratio degeneracy
    0 references
    kernel density estimation
    0 references
    importance sampling
    0 references
    exact sampling
    0 references
    rare-event probability estimation
    0 references
    combinatorial counting
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references