Sciweavers

4315 search results - page 16 / 863
» Sorting in linear time
Sort
View
160
Voted
KBS
2011
81views more  KBS 2011»
14 years 9 months ago
Existential rigidity and many modalities in order-sorted logic
Order-sorted logic is a useful tool for knowledge representation and reasoning because it enables representation of sorted terms and formulas along with partially ordered sorts (c...
Ken Kaneiwa
141
Voted
ESA
2004
Springer
166views Algorithms» more  ESA 2004»
15 years 8 months ago
Super Scalar Sample Sort
Sample sort, a generalization of quicksort that partitions the input into many pieces, is known as the best practical comparison based sorting algorithm for distributed memory para...
Peter Sanders, Sebastian Winkel
129
Voted
VLDB
1997
ACM
126views Database» more  VLDB 1997»
15 years 7 months ago
Dynamic Memory Adjustment for External Mergesort
Sorting is a memory intensive operation whose performance is greatly affected by the amount of memory available as work space. When the input size is unknown or available memory s...
Weiye Zhang, Per-Åke Larson
133
Voted
IOR
2007
106views more  IOR 2007»
15 years 2 months ago
Planning and Scheduling by Logic-Based Benders Decomposition
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
John N. Hooker
109
Voted
TPDS
1998
76views more  TPDS 1998»
15 years 2 months ago
Randomized Routing, Selection, and Sorting on the OTIS-Mesh
The Optical Transpose Interconnection System (OTIS) is a recently proposed model of computing that exploits the special features of both electronic and optical technologies. In th...
Sanguthevar Rajasekaran, Sartaj Sahni