summaryrefslogtreecommitdiff
path: root/sampling_alg_lac2020/LAC-20.tex
diff options
context:
space:
mode:
Diffstat (limited to 'sampling_alg_lac2020/LAC-20.tex')
-rw-r--r--sampling_alg_lac2020/LAC-20.tex2
1 files changed, 1 insertions, 1 deletions
diff --git a/sampling_alg_lac2020/LAC-20.tex b/sampling_alg_lac2020/LAC-20.tex
index 6db19d6..3d2fdae 100644
--- a/sampling_alg_lac2020/LAC-20.tex
+++ b/sampling_alg_lac2020/LAC-20.tex
@@ -511,7 +511,7 @@ To test the above hypotheses, we conduct the following experiments:
\todoandre{Do beautiful tables and plots here}
-\todoandre{Also do an experiment regarding the adaptive search}
+% \todoandre{Also do an experiment regarding the adaptive search}
To also get an idea of the performance of the new sampling algorithm, we want to see how many power values of samples are evaluated per query.
Without the smart search optimization described at the end of Section \ref{sec:implementation}, this number would always be the number of samples. However, we expect that the smart search optimization significantly reduces the number of evaluations. To test this hypothesis, we take the above experiment and look at the number of evaluations. You can see the histogram in Figure \ref{fig:evaluations_histogram}. \todo{fix}