3049 search results - page 176 / 610 » On the Convergence of Bound Optimization Algorithms |
198
click to vote
APBC
2008
15 years 8 months ago
2008
: Finding motifs and the corresponding binding sites is a critical and challenging problem in studying the process of gene expression. String and matrix representations are two pop...
154
click to vote
GECCO
2010
Springer
15 years 11 months ago
2010
Springer
Niching schemes, which sustain population diversity and let an evolutionary population avoid premature convergence, have been extensively studied in the research field of evoluti...
143
click to vote
COCOON
2007
Springer
16 years 19 days ago
2007
Springer
We propose new algorithms and improved bounds for interference-aware routing in wireless networks. First, we prove that n arbitrarily matched source-destinations pairs with average...
174
click to vote
SIGECOM
2009
ACM
16 years 29 days ago
2009
ACM
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
187
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Multiple sequence alignment is fundamental. Exponential growth in computation time appears to be inevitable when an optimal alignment is required for many sequences. E...