Pages that link to "Item:Q1282386"

The following pages link to Approximating the permanent via importance sampling with application to the dimer covering problem (Q1282386):

Displaying 16 items.

• Numerical integration in statistical decision-theoretic methods for robust design optimization (Q373980) (← links)
• A partially structure-preserving algorithm for the permanents of adjacency matrices of fullerenes (Q709589) (← links)
• Several constants arising in statistical mechanics (Q1306604) (← links)
• Stochastic enumeration with importance sampling (Q1739341) (← links)
• Scaling matrices and counting the perfect matchings in graphs (Q2064289) (← links)
• On a conservative partition refinement (CPR) method for a class of two-stage stochastic programming problems (Q2091214) (← links)
• Efficient generation of random derangements with the expected distribution of cycle lengths (Q2204174) (← links)
• Permanents, \(\alpha\)-permanents and Sinkhorn balancing (Q2259826) (← links)
• A hybrid algorithm for computing permanents of sparse matrices (Q2369215) (← links)
• Theory of computation of multidimensional entropy with an application to the monomer-dimer problem (Q2568107) (← links)
• On the Monomer–Dimer Problem of Some Graphs (Q3560181) (← links)
• Monomer-dimer problem on random planar honeycomb lattice (Q5414765) (← links)
• An algorithmic proof of Brégman–Minc theorem (Q5850764) (← links)
• Accelerating convergence in stochastic particle dispersion simulation codes (Q5953231) (← links)
• Sequential importance sampling for estimating expectations over the space of perfect matchings (Q6103989) (← links)
• Asymptotics of discrete Schrödinger bridges via chaos decomposition (Q6565309) (← links)