noa/thesis
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

add exponentials

Browse source
This commit is contained in:
Noa Aarts 2025-12-11 13:56:41 +01:00
parent 989adc950e
commit 57f4398f46
Signed by: noa
GPG key ID: 1850932741EFF672
1 changed files with 3 additions and 4 deletions
Download patch file Download diff file Expand all files Collapse all files

7
presentations/progress.typ
View file

@ -73,7 +73,6 @@ Methods of QAS
- Sort by 2nd proxy - Sort by 2nd proxy
- Try optimising - Try optimising
- Noise systems not included - Noise systems not included
- Hardware connectivity only on random sampling
] ]
== Reinforcement Learning QAS@akash == Reinforcement Learning QAS@akash
@ -248,11 +247,11 @@ Likely better for us: "Sampling and Filtering"
The amount of shuffles where no shared neighbors before and after exist: The amount of shuffles where no shared neighbors before and after exist:
- 16: 131072 - 16: $131072 = 2^17$
- 17: 8454144 - 17: $8454144 approx 2^23.01$
- 18: 174063616 - 18: $174063616 approx 2^27.38$
- 19: ??? - 19: ???