Analysis of the Performance Impact of Black-box Randomization for 7 Sorting Algorithms
Can black-box randomization change the performance of algorithms? The problem of worst-case behaviour in algorithms is difficult to handle, black-box randomization is one method that has not been rigorously tested. If it could be used to mitigate worst-case behaviour for our chosen algorithms, black...
Main Authors: | Eskandari, Aram, Tellström, Benjamin |
---|---|
Format: | Others |
Language: | English |
Published: |
KTH, Skolan för teknikvetenskap (SCI)
2018
|
Subjects: | |
Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-231089 |
Similar Items
-
Implementation and Verification of Sorting Algorithms with the Interactive Theorem Prover HOL
by: Quarfot Orrevall, Sara
Published: (2020) -
The future of grey-box fuzzing
by: Hjelt, Isak
Published: (2017) -
Impact of model accuracy on the performance of an optimization-based path planning algorithm for an articulated vehicle
by: Chen, Deyuan, et al.
Published: (2019) -
High Performance Implementationof Winner Selection Algorithms
by: GIlle, Johan, et al.
Published: (2017) -
Application of the hot-box technique to test the insulation effect of low-emissivity film on old windows
by: Vergés Gil, Albert
Published: ()