1725 search results - page 26 / 345 » Relaxed genetic programming |
110
click to vote
ICAI
2004
15 years 4 months ago
2004
Even though the Genetic Programming (GP) mechanism is capable of evolving any computable function, the means through which it does so is inherently flawed: the user must provide th...
115
click to vote
ICML
2007
IEEE
16 years 3 months ago
2007
IEEE
Although support vector machines (SVMs) for binary classification give rise to a decision rule that only relies on a subset of the training data points (support vectors), it will ...
113
click to vote
ISSRE
2007
IEEE
15 years 4 months ago
2007
IEEE
Constraint-Based Testing (CBT) is the process of generating test cases against a testing objective by using constraint solving techniques. In CBT, testing objectives are given und...
101
click to vote
EOR
2002
15 years 2 months ago
2002
Let F be a subset of the n-dimensional Euclidean space Rn represented in terms of a compact convex subset C0 and a set PF of nitely or in nitely many quadratic functions on Rn such...
125
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We introduce two min-max problems: the first problem is to minimize the supremum of finitely many rational functions over a compact basic semi-algebraic set whereas the s...