A genetic algorithm approach to estimate lower bounds of the star discrepancy
From MaRDI portal
Publication:3068191
DOI10.1515/MCMA.2010.014zbMath1206.11098OpenAlexW2274584532MaRDI QIDQ3068191
Publication date: 13 January 2011
Published in: Monte Carlo Methods and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/mcma.2010.014
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Irregularities of distribution, discrepancy (11K38)
Related Items (6)
Entropy, Randomization, Derandomization, and Discrepancy ⋮ A Metropolis random walk algorithm to estimate a lower bound of the star discrepancy ⋮ Measures of uniformity in experimental designs: A selective overview ⋮ A random walk algorithm to estimate a lower bound of the star discrepancy ⋮ Calculation of Discrepancy Measures and Applications ⋮ Uniform point sets and the collision test
Cites Work
- A note on E. Thiémard's algorithm to compute bounds for the star discrepancy
- On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals
- Good permutations for deterministic scrambled Halton sequences in terms of \(L_2\)-discrepancy
- Finding optimal volume subintervals with \( k\) points and calculating the star discrepancy are NP-hard problems
- On the \(L_2\)-discrepancy for anchored boxes
- An algorithm to compute bounds for the star discrepancy
- Randomized Halton sequences
- Genetic algorithms for the traveling salesman problem
- Bracketing numbers for axis-parallel boxes and applications to geometric discrepancy
- Application of Threshold-Accepting to the Evaluation of the Discrepancy of a Set of Points
This page was built for publication: A genetic algorithm approach to estimate lower bounds of the star discrepancy
