Pages that link to "Item:Q1347864"

The following pages link to An algorithm to compute bounds for the star discrepancy (Q1347864):

Displaying 32 items.

• Hardness of discrepancy computation and \(\varepsilon\)-net verification in high dimension (Q413466) (← links)
• Statistical measures of two dimensional point set uniformity (Q435027) (← links)
• A note on E. Thiémard's algorithm to compute bounds for the star discrepancy (Q558008) (← links)
• Algorithmic construction of low-discrepancy point sets via dependent randomized rounding (Q708312) (← links)
• Good permutations for deterministic scrambled Halton sequences in terms of \(L_2\)-discrepancy (Q818189) (← links)
• Calculation of the discrepancy of a finite set of points in the unit \(n\) -cube (Q946017) (← links)
• Finding optimal volume subintervals with \( k\) points and calculating the star discrepancy are NP-hard problems (Q1023397) (← links)
• Coverage-guided test generation for continuous and hybrid systems (Q1039844) (← links)
• Optimal volume subintervals with \(k\) points and star discrepancy via integer programming (Q1396997) (← links)
• Computing bounds for the star discrepancy (Q1592539) (← links)
• Tractability properties of the weighted star discrepancy of regular grids (Q1745636) (← links)
• On the arrangement of point sets in the unit interval (Q1942247) (← 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 computational investigation of the optimal Halton sequence in QMC applications (Q2335713) (← links)
• Uniform point sets and the collision test (Q2349667) (← links)
• Smart sampling and incremental function learning for very large high dimensional data (Q2418181) (← links)
• Bracketing numbers for axis-parallel boxes and applications to geometric discrepancy (Q2483204) (← links)
• Measures of uniformity in experimental designs: A selective overview (Q2816836) (← links)
• A new randomized algorithm to approximate the star discrepancy based on threshold accepting (Q2903013) (← links)
• A genetic algorithm approach to estimate lower bounds of the star discrepancy (Q3068191) (← links)
• A best possible upper bound on the star discrepancy of (t, m, 2)-nets (Q3412508) (← links)
• Component-by-component construction of low-discrepancy point sets of small size (Q3516786) (← links)
• Replication procedure for grouped Sobol' indices estimation in dependent uncertainty spaces (Q4603593) (← links)
• A generalized Faulhaber inequality, improved bracketing covers, and applications to discrepancy (Q4956929) (← 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)
• Heuristic approaches to obtain low-discrepancy point sets via subset selection (Q6540041) (← links)
• Improved bounds for the bracketing number of orthants or revisiting an algorithm of Thiémard to compute bounds for the star discrepancy (Q6540045) (← links)
• On the discrepancy of low-dimensional probability measures (Q6633978) (← links)