1725 search results - page 39 / 345 » Relaxed genetic programming |
213
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
Choosing the right representation for a problem is important. In this article we introduce a linear genetic programming approach for motif discovery in protein families, and we al...
273
click to vote
CP
2009
Springer
16 years 6 months ago
2009
Springer
We introduce a new approach to approximating weighted Max-SAT problems that is based on simplifying a given instance, and then tightening the approximation. First, we relax its str...
165
click to vote
FCT
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. In recent years we have witnessed the proliferation of semidefinite programming bounds in combinatorial optimization [1,5,8], quantum computing [9,2,3,6,4,16] and even in...
135
click to vote
CPAIOR
2005
Springer
15 years 11 months ago
2005
Springer
Creating good integer programming formulations had, as a basic axiom, the rule “Find formulations with tighter linear relaxations”. This rule, while useful when using unsophist...
162
click to vote
NIPS
2003
15 years 7 months ago
2003
Learning from ambiguous training data is highly relevant in many applications. We present a new learning algorithm for classification problems where labels are associated with se...