Pages that link to "Item:Q2631360"
From MaRDI portal
The following pages link to Monte Carlo algorithms for computing \(\alpha \)-permanents (Q2631360):
Displaying 7 items.
- Using the Monte Carlo method for fast simulation of the number of ``good'' permutations on the SCIT-4 multiprocessor computer complex (Q289789) (← links)
- Monte Carlo circuits for the abelian permutation group intersection problem (Q1820579) (← links)
- Employing the MCMC technique to compute the projection depth in high dimensions (Q2141582) (← links)
- Estimating the permanent by importance sampling from a finite population (Q2784184) (← links)
- Approximating the -permanent (Q3399076) (← links)
- Monte-Carlo approximation algorithms for enumeration problems (Q3834934) (← links)
- A note on random walks with absorbing barriers and sequential Monte Carlo methods (Q4639177) (← links)