Construction of symmetric orthogonal designs with deep Q-network and orthogonal complementary design
From MaRDI portal
Publication:2129592
Recommendations
- Some new constructions of orthogonal designs
- On the existence and constructions of orthogonal designs
- A note on automatic construction algorithms for orthogonal designs of experiments using error correcting codes
- Constructing orthogonal designs in powers of two via symbolic computation and rewriting techniques
- scientific article; zbMATH DE number 4049663
Cites work
- scientific article; zbMATH DE number 1313654 (Why is no real title available?)
- scientific article; zbMATH DE number 3048068 (Why is no real title available?)
- 18-run nonisomorphic three level orthogonal arrays
- A general reinforcement learning algorithm that masters chess, shogi, and Go through self-play
- A new approach in constructing orthogonal and nearly orthogonal arrays.
- Algebraic generation of minimum size orthogonal fractional factorial designs: an approach based on integer linear programming
- An Algorithmic Approach to Constructing Supersaturated Designs
- Classification of affine resolvable \(2\)-\((27,9,4)\) designs
- Complete enumeration of pure-level and mixed-level orthogonal arrays
- Construction of uniform designs via an adjusted threshold accepting algorithm
- On the Problem of Construction of Orthogonal Arrays
- Optimization by simulated annealing
- Orthogonal Arrays of Strength two and three
- Orthogonal arrays. Theory and applications
- Recent developments in nonregular fractional factorial designs
- Superhuman AI for multiplayer poker
- Time- and Space-Saving Computer Methods, Related to Mitchell's DETMAX, for Finding D-Optimum Designs
- Uniform Design: Theory and Application
Cited in
(2)
This page was built for publication: Construction of symmetric orthogonal designs with deep Q-network and orthogonal complementary design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2129592)