MinT: A Database for Optimal Net Parameters
From MaRDI portal
Publication:5482384
DOI10.1007/3-540-31186-6_28zbMATH Open1130.65302OpenAlexW63651990MaRDI QIDQ5482384FDOQ5482384
Authors: Rudolf Schürer, Wolfgang Ch. Schmid 
Publication date: 28 August 2006
Published in: Monte Carlo and Quasi-Monte Carlo Methods 2004 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-31186-6_28
Recommendations
- MINTO, a Mixed INTeger Optimizer
- scientific article; zbMATH DE number 515929
- MinT-architecture and applications of the \((t, m, s)\)-net and OOA database
- M-nets: a survey
- The performance of NLPNET, a large-scale nonlinear network optimizer
- Minotaur: a mixed-integer nonlinear optimization toolkit
- Computing optimal scalings by parametric network algorithms
- A Minty variational principle for set optimization
- Searching for minimal optimal neural networks
Random number generation in numerical analysis (65C10) Pseudo-random numbers; Monte Carlo methods (11K45)
Cited In (20)
- Reducing a model of sugar metabolism in peach to catch different patterns among genotypes
- New explicit bounds for ordered codes and \((t,m,s)\)-nets
- Differential approach for the study of duals of algebraic-geometric codes on surfaces
- Cubic and higher degree bounds for codes and \((t,m,s)\)-nets
- An explicit construction of point sets with large minimum Dick weight
- On the complexity of additively homomorphic UC commitments
- Local antithetic sampling with scrambled nets
- Cryptographic properties of cyclic binary matrices
- Duality for digital sequences
- Skeleton simplicial evaluation codes
- On the exact \(t\)-value of Niederreiter and Sobol' sequences
- A global adaptive quasi-Monte Carlo algorithm for functions of low truncation dimension applied to problems from finance
- MinT
- A direct approach to linear programming bounds for codes and tms-nets
- On the existence of higher order polynomial lattices based on a generalized figure of merit
- MinT -- new features and new results
- Classification and nonexistence results for linear codes with prescribed minimum distances
- New star discrepancy bounds for \((t,m,s)\)-nets and \((t,s)\)-sequences
- MinT-architecture and applications of the \((t, m, s)\)-net and OOA database
- Some constructions of \((t,m,s)\)-nets with improved parameters
This page was built for publication: MinT: A Database for Optimal Net Parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5482384)
