1080 search results - page 14 / 216 » Problem dependent optimization (PDO) |
138
Voted
TCBB
2008
15 years 3 months ago
2008
The problem of discovering novel motifs of binding sites is important to the understanding of gene regulatory networks. Motifs are generally represented by matrices (PWM or PSSM) o...
154
click to vote
MICRO
2006
IEEE
15 years 9 months ago
2006
IEEE
The superblock is a scheduling region which exposes instruction level parallelism beyond the basic block through speculative execution of instructions. In general, scheduling supe...
ICMCS
2006
IEEE
15 years 9 months ago
2006
IEEE
In this paper, we consider the problem of optimal self-embedding Lapalcian data hiding for the state-dependent channels. In particular, we propose to decompose the Laplacian data ...
145
Voted
MOR
2010
15 years 2 months ago
2010
We study the convergence properties of an alternating proximal minimization algorithm for nonconvex structured functions of the type: L(x, y) = f(x)+Q(x, y)+g(y), where f : Rn → ...
151
Voted
CEC
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract— Memetic algorithms arise as very effective algorithms to obtain reliable and high accurate solutions for complex continuous optimization problems. Nowadays, high dimens...