summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorAndré Nusser <andre.nusser@googlemail.com>2020-02-05 00:13:02 +0100
committerAndré Nusser <andre.nusser@googlemail.com>2020-02-05 00:13:02 +0100
commit27223d7a2947f3c434e90bfbcbb448a843a3146e (patch)
tree984f28371a95ecbd24e11e52e642908a20fb1e3b
parentb749845b459df34e0151ba905c60f801335a1038 (diff)
And remove another useless todo.
-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}