Sciweavers

10988 search results - page 389 / 2198
» Algorithmic Folding Complexity
Sort
View
123
Voted
CPAIOR
2004
Springer
15 years 10 months ago
O(n log n) Filtering Algorithms for Unary Resource Constraint
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...
Petr Vilím
AAAI
2006
15 years 6 months ago
A New Approach to Estimating the Expected First Hitting Time of Evolutionary Algorithms
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,...
Yang Yu, Zhi-Hua Zhou
139
Voted
ICGA
1997
103views Optimization» more  ICGA 1997»
15 years 6 months ago
Genetic Algorithm for Restrictive Channel Routing Problem
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...
116
Voted
ICASSP
2010
IEEE
15 years 5 months ago
Fast structural similarity index algorithm
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...
Ming-Jun Chen, Alan Conrad Bovik
151
Voted
BMCBI
2008
83views more  BMCBI 2008»
15 years 5 months ago
An efficient genetic algorithm for structural RNA pairwise alignment and its application to non-coding RNA discovery in yeast
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...
Akito Taneda