๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An improved block-interchange algorithm

โœ Scribed by John L Mohammed; Carlos S Subi


Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
487 KB
Volume
8
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


An improved test block
๐Ÿ“‚ Article ๐Ÿ“… 1963 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 105 KB
An improved LLL algorithm
โœ Franklin T. Luk; Daniel M. Tracy ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 145 KB

The LLL algorithm has received a lot of attention as an effective numerical tool for preconditioning an integer least squares problem. However, the workings of the algorithm are not well understood. In this paper, we present a new way to look at the LLL reduction, which leads to a new implementation

An improved Shellsort algorithm
โœ Liu Renren ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 345 KB

Shellsort algorithm is a refinement of the straight insertion soIt. Each pass of this method sorts all items which are h-position apart by straight insertion sort, and the place of the item to be inserted in is determined by comparing items which are already ordered from right to left. In this pape

Sorting permutations by block-interchang
โœ David A. Christie ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 400 KB

Various global rearrangements of permutations, such as reversals and transpositions have recently become of interest because of their applications in genome analysis. The study of such rearrangements leads to computational problems that are of interest in their own right. In this paper we introduce