279 search results - page 23 / 56 » Type-II Optimal Polynomial Bases |
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
DCC
2004
IEEE
14 years 8 months ago
2004
IEEE
A steepest descent based bit allocation method with polynomial iteration complexity for minimizing the sum of frame distortions under a total bit rate constraint is presented for ...
CPM
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. This paper addresses the problem of aligning multiple sequences of non-coding RNA genes. We approach this problem with the biologically motivated paradigm that scoring of...
DEXA
1995
Springer
14 years 9 days ago
1995
Springer
Abstract. The object-oriented database management systems store references to objects (implicit joins, precomputed joins), and use path expressions in query languages. One way of e...
DAM
2008
13 years 8 months ago
2008
We investigate the Semidefinite Programming based Sums of squares (SOS) decomposition method, designed for global optimization of polynomials, in the context of the (Maximum) Sati...