Autor:	Dmitri Asonov
Rok vydání:	2004
Předmět:	Shuffling Section (archaeology) Computer science Algorithm
Zdroj:	Querying Databases Privately ISBN: 9783540224419
DOI:	10.1007/978-3-540-27770-5_5
Popis:	The previous chapter proposed a new shuffling algorithm (SSG) and estimated its complexity theoretically. This chapter naturally amplifies the previous chapter with the experimental analysis of the performance of SSG and concurrent approaches (SSA and SBS). Section 5.1 describes a shuffling algorithm from related work (SBS). Section 5.2 explains the experiments we performed to find the best shuffling algorithm among SSA, SSG, and SBS. Section 5.3 focuses on explaining the paradoxical experimental result from Section 5.2.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::dbb8d1e53355c61f67f27473db59dcc4 https://doi.org/10.1007/978-3-540-27770-5_5 Zobrazit plný text záznamu