602 search results - page 69 / 121 » Unsupervised Problem Decomposition Using Genetic Programming |
PPSN
1994
Springer
14 years 3 months ago
1994
Springer
Abstract. The mutation distribution of evolutionary algorithms usually is oriented at the type of the search space. Typical examples are binomial distributions for binary strings i...
ICTAI
2000
IEEE
14 years 3 months ago
2000
IEEE
This paper presents a problem-independent framework that uni es various mechanisms for solving discrete constrained nonlinear programming (NLP) problems whose functions are not ne...
CCE
2004
13 years 11 months ago
2004
Significant advances have been made in the last two decades for the effective solution of mixed integer non-linear programming (MINLP) problems, mainly by exploiting the special s...
CVPR
2010
IEEE
14 years 7 months ago
2010
IEEE
A central problem in the analysis of motion capture (Mo-
Cap) data is how to decompose motion sequences into primitives.
Ideally, a description in terms of primitives should
fac...
KBSE
1997
IEEE
14 years 3 months ago
1997
IEEE
In software testing, it is often desirable to find test inputs that exercise specific program features. To find these inputs by hand is extremely time-consuming, especially whe...