Sciweavers

152 search results - page 6 / 31
» Sorting by reversals is difficult
Sort
View
HPCC
2007
Springer
14 years 1 months ago
Parallel Database Sort and Join Operations Revisited on Grids
Based on the renowned method of Bitton et al. (see [1]) we develop a concise but comprehensive analytical model for the well-known Binary Merge Sort, Bitonic Sort, Nested-Loop Join...
Werner Mach, Erich Schikuta
DM
2007
119views more  DM 2007»
13 years 7 months ago
Short proofs for cut-and-paste sorting of permutations
We consider the problem of determining the maximum number of moves required to sort a permutation of [n] using cut-and-paste operations, in which a segment is cut out and then pas...
Daniel W. Cranston, Ivan Hal Sudborough, Douglas B...
GECCO
2006
Springer
191views Optimization» more  GECCO 2006»
13 years 11 months ago
The Brueckner network: an immobile sorting swarm
In many industrial applications, the dynamic control of queuing and routing presents difficult challenges. We describe a novel ant colony control system for a multiobjective sorti...
William A. Tozier, Michael R. Chesher, Tejinderpal...
IWPC
2006
IEEE
14 years 1 months ago
Integrating Reverse Engineering Tools Using a Service-Sharing Methodology
A common and difficult maintenance activity is the integration of existing software components or tools into a consistent and interoperable whole. One area in which this has prove...
Dean Jin, James R. Cordy
IEAAIE
2007
Springer
14 years 1 months ago
Integrated Framework for Reverse Logistics
Although reverse logistics has been disregarded for many years, pressures from both environmental awareness and business sustainability have risen. Reverse logistical activities in...
Heng-Li Yang, Chen-Shu Wang