1563 search results - page 117 / 313 » Performance comparison of memetic algorithms |
216
click to vote
CPM
1998
Springer
15 years 10 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
152
click to vote
APPINF
2003
15 years 7 months ago
2003
Discovering association rules by identifying relationships among sets of items in a transaction database is an important problem in Data Mining. Finding frequent itemsets is compu...
258
click to vote
INFOCOM
2011
IEEE
14 years 10 months ago
2011
IEEE
Abstract—This work proposes a novel connectivity-based localization algorithm, well suitable for large-scale sensor networks with complex shapes and non-uniform nodal distributio...
190
click to vote
DAGM
2008
Springer
15 years 8 months ago
2008
Springer
The design of inference algorithms for discrete-valued Markov Random Fields constitutes an ongoing research topic in computer vision. Large state-spaces, none-submodular energy-fun...
179
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Unraveling the mechanisms that regulate gene expression is a major challenge in biology. An important task in this challenge is to identify regulatory elements, especi...