602 search results - page 31 / 121 » Unsupervised Problem Decomposition Using Genetic Programming |
CEC
2009
IEEE
15 years 4 months ago
2009
IEEE
— In this paper, the performance assessment of the hybrid Archive-based Micro Genetic Algorithm (AMGA) on a set of bound-constrained synthetic test problems is reported. The hybr...
FOCS
1991
IEEE
15 years 1 months ago
1991
IEEE
We perform linear programming optimizations on the intersection of k polyhedra in R3 , represented by their outer recursive decompositions, in expected time O(k log k log n + √ ...
QCQC
1998
Springer
15 years 1 months ago
1998
Springer
In order to design a quantum circuit that performs a desired quantum computation, it is necessary to find a decomposition of the unitary matrix that represents that computation in ...
PPSN
2000
Springer
15 years 1 months ago
2000
Springer
To investigate the fundamental causes of bloat, six artificial random binary tree search spaces are presented. Fitness is given by program syntax (the genetic programming genotype)...
102
click to vote
NIPS
2004
14 years 11 months ago
2004
We examine the problem of approximating, in the Frobenius-norm sense, a positive, semidefinite symmetric matrix by a rank-one matrix, with an upper bound on the cardinality of its...