Algorithmic construction of low-discrepancy point sets via dependent randomized rounding
From MaRDI portal
Recommendations
- Construction of low-discrepancy point sets of small size by bracketing covers and dependent randomized rounding
- Component-by-component construction of low-discrepancy point sets of small size
- Deterministic constructions of high-dimensional sets with small dispersion
- Construction Algorithms for Digital Nets with Low Weighted Star Discrepancy
- Bounds and constructions for the star-discrepancy via \(\delta\)-covers
Cites work
- scientific article; zbMATH DE number 53679 (Why is no real title available?)
- scientific article; zbMATH DE number 852056 (Why is no real title available?)
- scientific article; zbMATH DE number 2233281 (Why is no real title available?)
- A method for exact calculation of the discrepancy of low-dimensional finite point sets. I
- A method for exact calculation of the stardiscrepancy of plane sets applied to the sequences of Hammersley
- An algorithm to compute bounds for the star discrepancy
- Application of Threshold-Accepting to the Evaluation of the Discrepancy of a Set of Points
- Bounds and constructions for the star-discrepancy via \(\delta\)-covers
- Bracketing numbers for axis-parallel boxes and applications to geometric discrepancy
- Component-by-component construction of low-discrepancy point sets of small size
- Construction of low-discrepancy point sets of small size by bracketing covers and dependent randomized rounding
- Construction of minimal bracketing covers for rectangles
- Covering numbers, Vapnik-Červonenkis classes and bounds for the star-discrepancy
- Dependent rounding and its applications to approximation algorithms
- Finding optimal volume subintervals with \( k\) points and calculating the star discrepancy are NP-hard problems
- Generating Randomized Roundings with Cardinality Constraints and Derandomizations
- Implementation of a component-by-component algorithm to generate small low-discrepancy samples
- Low-discrepancy sequences and global function fields with many rational places
- MONTE CARLO METHODS FOR SOLVING MULTIVARIABLE PROBLEMS
- On tractability of weighted integration over bounded and unbounded regions in ℝ^{𝕤}
- Probabilistic construction of deterministic algorithms: approximating packing integer programs
- Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
- Randomized Rounding in the Presence of a Cardinality Constraint
- Sequences, discrepancies and applications
- The inverse of the star-discrepancy depends linearly on the dimension
Cited in
(19)- Hardness of discrepancy computation and \(\varepsilon\)-net verification in high dimension
- Discrepancy bounds for a class of negatively dependent random points including Latin hypercube samples
- Some results on the complexity of numerical integration
- Tractability results for the weighted star-discrepancy
- Infinite-dimensional integration on weighted Hilbert spaces
- scientific article; zbMATH DE number 1790438 (Why is no real title available?)
- A new randomized algorithm to approximate the star discrepancy based on threshold accepting
- Secure pseudorandom bit generators and point sets with low star-discrepancy
- A generalized Faulhaber inequality, improved bracketing covers, and applications to discrepancy
- Component-by-component construction of low-discrepancy point sets of small size
- The inverse of the star-discrepancy problem and the generation of pseudo-random numbers
- Implementation of a component-by-component algorithm to generate small low-discrepancy samples
- Heuristic approaches to obtain low-discrepancy point sets via subset selection
- Entropy, Randomization, Derandomization, and Discrepancy
- Calculation of discrepancy measures and applications
- Numerical integration of Hölder continuous, absolutely convergent Fourier, Fourier cosine, and Walsh series
- Construction of low-discrepancy point sets of small size by bracketing covers and dependent randomized rounding
- Probabilistic discrepancy bound for Monte Carlo point sets
- Deterministic constructions of high-dimensional sets with small dispersion
This page was built for publication: Algorithmic construction of low-discrepancy point sets via dependent randomized rounding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q708312)
