Construction of symmetric orthogonal designs with deep Q-network and orthogonal complementary design
From MaRDI portal
Publication:2129592
DOI10.1016/J.CSDA.2022.107448OpenAlexW4211065233MaRDI QIDQ2129592FDOQ2129592
Xiaoling Peng, Kai-Tai Fang, Lin-Chen Weng, Jianfa Lai
Publication date: 22 April 2022
Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.csda.2022.107448
orthogonal designdesign isomorphismsequential constructiondeep Q-networkorthogonal complementary design
Cites Work
- Optimization by Simulated Annealing
- Orthogonal arrays. Theory and applications
- Time- and Space-Saving Computer Methods, Related to Mitchell's DETMAX, for Finding D-Optimum Designs
- Orthogonal Arrays of Strength two and three
- Complete enumeration of pure-level and mixed-level orthogonal arrays
- Classification of affine resolvable \(2\)-\((27,9,4)\) designs
- Uniform Design: Theory and Application
- Title not available (Why is that?)
- Recent developments in nonregular fractional factorial designs
- On the Problem of Construction of Orthogonal Arrays
- Title not available (Why is that?)
- An Algorithmic Approach to Constructing Supersaturated Designs
- Construction of uniform designs via an adjusted threshold accepting algorithm
- A new approach in constructing orthogonal and nearly orthogonal arrays.
- 18-run nonisomorphic three level orthogonal arrays
- A general reinforcement learning algorithm that masters chess, shogi, and Go through self-play
- Algebraic generation of minimum size orthogonal fractional factorial designs: an approach based on integer linear programming
- Superhuman AI for multiplayer poker
Cited In (2)
Uses Software
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)
