Difference between revisions of "Thread:Talk:K-NN algorithm benchmark/Cache effects on benchmark/reply (3)"

From Robowiki
Jump to navigation Jump to search
 
(No difference)

Latest revision as of 12:56, 17 July 2013

For the best comparison, absolutely. However, it might be difficult to set up the battles so that every one is the same, particularly if the trees are non-deterministic due to things like points being equal. Also, it adds a lot of overhead which would make testing very slow.