stuart
Subtests Using Algorithmic Rummaging Techniques
Construct subtests from a pool of items by using ant-colony-optimization, genetic algorithms, brute force, or random sampling. Schultze (2017) <doi:10.17169/refubium-622>.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
0.10.2 |
rolling linux/jammy R-4.5 | stuart_0.10.2.tar.gz |
363.6 KiB |
0.10.2 |
rolling linux/noble R-4.5 | stuart_0.10.2.tar.gz |
363.7 KiB |
0.10.2 |
rolling source/ R- | stuart_0.10.2.tar.gz |
106.6 KiB |
0.10.2 |
latest linux/jammy R-4.5 | stuart_0.10.2.tar.gz |
363.6 KiB |
0.10.2 |
latest linux/noble R-4.5 | stuart_0.10.2.tar.gz |
363.7 KiB |
0.10.2 |
latest source/ R- | stuart_0.10.2.tar.gz |
106.6 KiB |
0.10.2 |
2026-04-26 source/ R- | stuart_0.10.2.tar.gz |
106.6 KiB |
0.10.2 |
2026-04-23 source/ R- | stuart_0.10.2.tar.gz |
106.6 KiB |
0.10.2 |
2026-04-09 windows/windows R-4.5 | stuart_0.10.2.zip |
366.9 KiB |
0.10.2 |
2025-04-20 source/ R- | stuart_0.10.2.tar.gz |
106.6 KiB |