602 search results - page 19 / 121 » Unsupervised Problem Decomposition Using Genetic Programming |
AIEDAM
2008
14 years 9 months ago
2008
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
113
click to vote
AE
2007
Springer
15 years 3 months ago
2007
Springer
The work presented in this paper is part of the development of a robotic system able to learn context dependent visual clues to navigate in its environment. We focus on the obstacl...
CP
2010
Springer
14 years 7 months ago
2010
Springer
We introduce a parallelized version of tree-decomposition based dynamic programming for solving difficult weighted CSP instances on many cores. A tree decomposition organizes cost ...
ISCAS
2005
IEEE
15 years 3 months ago
2005
IEEE
—In this work we propose a novel tree representation for RLC circuits. Genetic programming based on the tree representation is described and applied to passive filter synthesis p...
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
In this paper, we propose a genetic network programming (GNP) architecture using a coevolution model called automatically defined groups (ADG). The GNP evolves networks for describ...