In this paper, we are proposing a new Genetic Algorithmic approach to solve Static Channel Allocation Problem. Genetic Algorithms are one of the better optimization techniques. The main goal of this paper is to assign channels to cells with efficient usage of bandwidth. This new methodology consists of new crossover and mutation techniques, based on the reuse distance of channels. In crossover ...

The bi-dimensional two-way number partitioning problem is a generalization of the classical number partitioning problem, where instead of a set of integers we have a set of vectors of dimension 2 that have to be divided into two subsets so that the sums of the vectors in the subsets are equal or almost equal for both coordinates. This work presents three heuristic algorithms for solving the pro...

This paper is devoted to the “Discovery of Slowness.” The archetypical perversely awful algorithm bogo-sort, which is sometimes referred to as Monkey-sort, is analyzed with elementary methods. Moreover, practical experiments are performed.

We go beyond the notion of pairwise similarity and look into search problems with k-way similarity functions. In this paper, we focus on problems related to 3-way Jaccard similarity: R = |S1∩S2∩S3| |S1∪S2∪S3| , S1, S2, S3 ∈ C, where C is a size n collection of sets (or binary vectors). We show that approximate R similarity search problems admit fast algorithms with provable guarantees, analogou...

Cloud Computing (CC) has been emerged as the next generation of computing in IT Enterprise.CC migrates data and applications to huge data centers, where the management of data is totally under control of service providers. However this feature brings about various security concerns. Information authentication and its Integrity verification are such challenges in CC environment. Hash functions a...

There has been a growing interest in recent years in development of computational intelligence methodologies that relate to nature-inspired computational methodologies and approaches to address complex real-world problems to which traditional approaches, are ineffective or infeasible. The essential to development of novel algorithms is modeling the phenomena of the nature in that way that they ...

Eden is a parallel functional language extending Haskell with processes. This paper describes the implementation of an interface between the Eden language and the Maple system. The aim of this effort is to parallelize Maple programs by using Eden as coordination language. The idea is to leave in Maple the computational intensive functions of the (sequential) algorithm and to use Eden skeletons ...

The number partitioning problem is to divide a given set of n positive integers into k subsets, so that the sum of the numbers in each subset are as nearly equal as possible. While effective algorithms for two-way partitioning exist, multi-way partitioning is much more challenging. We introduce an improved algorithm for optimal multi-way partitioning, by combining several existing algorithms wi...

In this paper we introduce a software system which allows to carry out and visualize computational experiments for studying and researching the parallel algorithms of solving complicated computational problems in imitation mode on one single sequential computer. User can “assemble” a parallel computational system of cluster type that consists of multiprocessor and multicore nodes connected with...

The density-matrix renormalization-group [1, 2] (DMRG) is one of the most appropriate techniques to study static properties of the one-dimensional systems at zero temperature (for a review see, for example, Refs. 3 and 4). It is also possible to calculate dynamic properties [3–7] and work at finite-temperature through the DMRG [8–10]. The main advantage of DMRG, compared with the Lanczos exact ...