1725 search results - page 161 / 345 » Relaxed genetic programming |
102
click to vote
COLOGNETWENTE
2008
15 years 2 days ago
2008
Abstract. A reformulation of a mathematical program is a formulation which shares some properties with, but is in some sense better than, the original program. Reformulations are i...
170
click to vote
EMMCVPR
2011
Springer
13 years 10 months ago
2011
Springer
Abstract. We follow recent work by Schoenemann et al. [25] for expressing curvature regularity as a linear program. While the original formulation focused on binary segmentation, w...
106
click to vote
MP
2010
14 years 9 months ago
2010
The Lov´asz theta number of a graph G can be viewed as a semidefinite programming relaxation of the stability number of G. It has recently been shown that a copositive strengthe...
BMCBI
2010
14 years 10 months ago
2010
Background: Most software packages for whole genome association studies are non-graphical, purely text based programs originally designed to run with UNIX-like operating systems. ...
ICCD
2003
IEEE
15 years 7 months ago
2003
IEEE
We discuss the compaction of independent test sequences for sequential circuits. Our first contribution is the formulation of this problem as an integer program, which we then so...