Sciweavers

25 search results - page 3 / 5
» Optimal and Practical Algorithms for Sorting on the PDM
Sort
View
ESA
1995
Springer
127views Algorithms» more  ESA 1995»
13 years 9 months ago
Optimized Binary Search and Text Retrieval
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...
FCT
2001
Springer
13 years 10 months ago
Best Increments for the Average Case of Shellsort
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...
Marcin Ciura
GECCO
2010
Springer
254views Optimization» more  GECCO 2010»
13 years 10 months ago
Evolutionary multi-objective optimization and decision making for selective laser sintering
This paper proposes an integrated approach to arrive at optimal build orientations, simultaneously minimizing surface roughness ‘Ra’ and build time ‘T’, for object manufac...
Nikhil Padhye, Kalyanmoy Deb
MST
2002
128views more  MST 2002»
13 years 5 months ago
A Simple and Efficient Parallel Disk Mergesort
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...
Rakesh D. Barve, Jeffrey Scott Vitter
PEPM
2010
ACM
14 years 2 months ago
Optimizing relational algebra operations using generic equivalence discriminators and lazy products
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...
Fritz Henglein