In this paper, we propose use of convolutional codes for file dispersal. The proposed method is comparable in complexity to the information Dispersal Algorithm proposed by M.Rabin and for particular choices of (non-binary) convolutional codes, is almost as efficient as that algorithm in terms of controlling expansion in the total storage. Further, our proposed dispersal method allows string

The Apostolico-Giancarlo string-matching algorithm is analyzed precisely. We give a tight upper bound of 3 2 n text characters comparisons when searching for a pattern in a text of length n. We exhibit a family of patterns and texts reaching this bound. We also provide a slightly improved version of the algorithm.

We give faster algorithms for searching a 2-dimensional pattern in a 2-dimensional text allowing rotations, mismatches and/or insertion/deletion errors.

An optimalO(log log n) time parallel algorithm for string matching on CRCWPRAM is presented. It improves previous results of [G] and [V].

Scatter search is an evolutionary method that shares with genetic algorithms, a well-known evolutionary approach, the employment of a combination method that combines the features of two parent vectors to form several offspring. Furthermore, it uses improvement strategies to efficiently produce the local tuning of the solutions. An important aspect concerning scatter search is the trade-off bet...

Hussein search algorithm focuses on the fundamental concept of searching in computer science and aims to enhance retrieval data from various warehouses. The efficiency cloud systems is substantially influenced by manner which saved retrieved, given vast quantity being generated stored cloud. act entails systematic endeavor locating a particular item within substantial volume data, algorithms of...