A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...
This work proposes a parallel memetic algorithm applied to the total tardiness single machine scheduling problem. Classical models of parallel evolutionary algorithms and the gene...
In this paper, a novel multi-objective orthogonal simulated annealing algorithm MOOSA using a generalized Pareto-based scale-independent fitness function and multi-objective intell...
One can reduce the problem of proving that a polynomial is nonnegative, or more generally of proving that a system of polynomial inequalities has no solutions, to finding polynomi...
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In ...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...