Sciweavers

8431 search results - page 47 / 1687
» Algorithmically Independent Sequences
Sort
View
TCS
2008
14 years 9 months ago
Algorithms for computing variants of the longest common subsequence problem
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
Costas S. Iliopoulos, M. Sohel Rahman
BMCBI
2010
185views more  BMCBI 2010»
14 years 4 months ago
MetaPIGA v2.0: maximum likelihood large phylogeny estimation using the metapopulation genetic algorithm and other stochastic heu
Background: The development, in the last decade, of stochastic heuristics implemented in robust application softwares has made large phylogeny inference a key step in most compara...
Raphaël Helaers, Michel C. Milinkovitch
TSE
2010
197views more  TSE 2010»
14 years 4 months ago
A Genetic Algorithm-Based Stress Test Requirements Generator Tool and Its Empirical Evaluation
Genetic algorithms (GAs) have been applied previously to UML-driven, stress test requirements generation with the aim of increasing chances of discovering faults relating to networ...
Vahid Garousi
WASA
2009
Springer
165views Algorithms» more  WASA 2009»
15 years 4 months ago
Maximum Independent Set of Links under Physical Interference Model
This paper addresses the following optimization problem in a plane multihop wireless networks under the physical interference model: From a given a set of communication links whose...
Peng-Jun Wan, Xiaohua Jia, F. Frances Yao
ISCAS
2008
IEEE
169views Hardware» more  ISCAS 2008»
15 years 4 months ago
Sigma-delta learning for super-resolution independent component analysis
— Many source separation algorithms fail to deliver robust performance in presence of artifacts introduced by cross-channel redundancy, non-homogeneous mixing and highdimensional...
Amin Fazel, Shantanu Chakrabartty