2192 search results - page 30 / 439 » Algorithms for Challenging Motif Problems |
KDD
2010
ACM
13 years 10 months ago
2010
ACM
The fused Lasso penalty enforces sparsity in both the coefficients and their successive differences, which is desirable for applications with features ordered in some meaningful w...
ICGA
1993
13 years 9 months ago
1993
A genetic algorithms is applied to find a maximum flow from the source to sink in a weighted directed graph, where the weight associated with each edge represents its flow capacit...
EVOW
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Addressing dynamic optimization problems has been a challenging task for the genetic algorithm community. Over the years, several approaches have been developed into gene...
ISCAS
2006
IEEE
14 years 2 months ago
2006
IEEE
The efficient design of multiplierless implementa- The goal is to find the optimal sub-expressions across all N dot tions of constant matrix multipliers is challenged by the huge p...
ANOR
2011
12 years 11 months ago
2011
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...