Sciweavers

1215 search results - page 108 / 243
» Application domain study of evolutionary algorithms in optim...
Sort
View
CEC
2007
IEEE
15 years 7 months ago
Memetic algorithms for inexact graph matching
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
Thomas Bärecke, Marcin Detyniecki
ISAAC
2004
Springer
125views Algorithms» more  ISAAC 2004»
15 years 6 months ago
Local Gapped Subforest Alignment and Its Application in Finding RNA Structural Motifs
RNA molecules whose secondary structures contain similar substructures often have similar functions. Therefore, an important task in the study of RNA is to develop methods for disc...
Jesper Jansson, Ngo Trung Hieu, Wing-Kin Sung
175
Voted
GECCO
2007
Springer
558views Optimization» more  GECCO 2007»
15 years 7 months ago
A chain-model genetic algorithm for Bayesian network structure learning
Bayesian Networks are today used in various fields and domains due to their inherent ability to deal with uncertainty. Learning Bayesian Networks, however is an NP-Hard task [7]....
Ratiba Kabli, Frank Herrmann, John McCall
PRL
2010
188views more  PRL 2010»
14 years 8 months ago
A fast divisive clustering algorithm using an improved discrete particle swarm optimizer
As an important technique for data analysis, clustering has been employed in many applications such as image segmentation, document clustering and vector quantization. Divisive cl...
Liang Feng, Ming-Hui Qiu, Yu-Xuan Wang, Qiao-Liang...
SPIRE
2005
Springer
15 years 7 months ago
Composite Pattern Discovery for PCR Application
We consider the problem of finding pairs of short patterns such that, in a given input sequence of length n, the distance between each pair’s patterns is at least α. The proble...
Stanislav Angelov, Shunsuke Inenaga