We present an algorithm that minimizes the expected cost of indirect binary search for data with non-constant access costs, such as disk data. Indirect binary search means that sor...
Eduardo F. Barbosa, Gonzalo Navarro, Ricardo A. Ba...
This paper presents the results of using sequential analysis to find increment sequences that minimize the average running time of Shellsort, for array sizes up to several thousan...
This paper proposes an integrated approach to arrive at optimal build orientations, simultaneously minimizing surface roughness ‘Ra’ and build time ‘T’, for object manufac...
External sorting--the process of sorting a file that is too large to fit into the computer's internal memory and must be stored externally on disks--is a fundamental subroutin...
We show how to efficiently evaluate generic map-filter-product queries, generalizations of select-project-join (SPJ) queries in relational algebra, based on a combination of two...