A genetic algorithm approach to estimate lower bounds of the star discrepancy
From MaRDI portal
Publication:3068191
DOI10.1515/MCMA.2010.014zbMATH Open1206.11098OpenAlexW2274584532MaRDI QIDQ3068191FDOQ3068191
Authors: M. Shah 
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
Recommendations
- An algorithm to compute bounds for the star discrepancy
- A random walk algorithm to estimate a lower bound of the star discrepancy
- A new randomized algorithm to approximate the star discrepancy based on threshold accepting
- Computing bounds for the star discrepancy
- A Metropolis random walk algorithm to estimate a lower bound of the star discrepancy
- A note on E. Thiémard's algorithm to compute bounds for the star discrepancy
- An intermediate bound on the star discrepancy
- Star discrepancy subset selection: problem formulation and efficient approaches for low dimensions
- On an explicit lower bound for the star discrepancy in three dimensions
- A metrical lower bound on the star discrepancy of digital sequences
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Irregularities of distribution, discrepancy (11K38)
Cites Work
- Randomized Halton sequences
- On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals
- Genetic algorithms for the traveling salesman problem
- Application of Threshold-Accepting to the Evaluation of the Discrepancy of a Set of Points
- On the \(L_2\)-discrepancy for anchored boxes
- Finding optimal volume subintervals with \( k\) points and calculating the star discrepancy are NP-hard problems
- An algorithm to compute bounds for the star discrepancy
- Bracketing numbers for axis-parallel boxes and applications to geometric discrepancy
- Good permutations for deterministic scrambled Halton sequences in terms of \(L_2\)-discrepancy
- A note on E. Thiémard's algorithm to compute bounds for the star discrepancy
Cited In (9)
- Star discrepancy subset selection: problem formulation and efficient approaches for low dimensions
- An algorithm to compute bounds for the star discrepancy
- A random walk algorithm to estimate a lower bound of the star discrepancy
- Calculation of discrepancy measures and applications
- Measures of uniformity in experimental designs: a selective overview
- A Metropolis random walk algorithm to estimate a lower bound of the star discrepancy
- A new randomized algorithm to approximate the star discrepancy based on threshold accepting
- Uniform point sets and the collision test
- Entropy, Randomization, Derandomization, and Discrepancy
This page was built for publication: A genetic algorithm approach to estimate lower bounds of the star discrepancy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3068191)
