So far, edge-finding is the only one major filtering algorithm for unary resource constraint with time complexity O(n log n). This paper proposes O(n log n) versions of another t...
The expected first hitting time is an important issue in theoretical analyses of evolutionary algorithms since it implies the average computational time complexity. In this paper,...
This paper presents a genetic algorithm for the restrictive channel routing problem. The major difference of the algorithm from already known genetic algorithms for this problem c...
Vladimir N. Davidenko, Victor M. Kureichik, Victor...
The development of real-time image quality assessment algorithms is an important direction on which little research has focused. This paper presents a design of real-time implemen...
Background: Aligning RNA sequences with low sequence identity has been a challenging problem since such a computation essentially needs an algorithm with high complexities for tak...