Pages that link to "Item:Q2903013"
From MaRDI portal
The following pages link to A new randomized algorithm to approximate the star discrepancy based on threshold accepting (Q2903013):
Displaying 17 items.
- A note on E. Thiémard's algorithm to compute bounds for the star discrepancy (Q558008) (← links)
- Finding optimal volume subintervals with \( k\) points and calculating the star discrepancy are NP-hard problems (Q1023397) (← links)
- An algorithm to compute bounds for the star discrepancy (Q1347864) (← links)
- A random walk algorithm to estimate a lower bound of the star discrepancy (Q2101133) (← links)
- Star discrepancy subset selection: problem formulation and efficient approaches for low dimensions (Q2121499) (← links)
- A nonlocal functional promoting low-discrepancy point sets (Q2274413) (← links)
- Uniform point sets and the collision test (Q2349667) (← links)
- Octagonal symmetry in low-discrepancy \(\beta\)-manganese (Q2808953) (← links)
- Measures of uniformity in experimental designs: A selective overview (Q2816836) (← links)
- The Inverse of the Star-Discrepancy Problem and the Generation of Pseudo-Random Numbers (Q2945082) (← links)
- A genetic algorithm approach to estimate lower bounds of the star discrepancy (Q3068191) (← links)
- Calculation of Discrepancy Measures and Applications (Q5264200) (← links)
- Entropy, Randomization, Derandomization, and Discrepancy (Q5326100) (← links)
- Low-discrepancy point sets for non-uniform measures (Q5419536) (← links)
- A Metropolis random walk algorithm to estimate a lower bound of the star discrepancy (Q6112122) (← links)
- Overcoming the numerical sign problem in the Wigner dynamics via adaptive particle annihilation (Q6491576) (← links)
- Heuristic approaches to obtain low-discrepancy point sets via subset selection (Q6540041) (← links)
