Sciweavers

602 search results - page 19 / 121
» Unsupervised Problem Decomposition Using Genetic Programming
Sort
View
AIEDAM
2008
127views more  AIEDAM 2008»
13 years 11 months ago
Evolving blackbox quantum algorithms using genetic programming
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 ...
Ralf Stadelhofer, Wolfgang Banzhaf, Dieter Suter
AE
2007
Springer
14 years 5 months ago
Automatic Design of Vision-Based Obstacle Avoidance Controllers Using Genetic Programming
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...
Renaud Barate, Antoine Manzanera
CP
2010
Springer
13 years 9 months ago
Towards Parallel Non Serial Dynamic Programming for Solving Hard Weighted CSP
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 ...
David Allouche, Simon de Givry, Thomas Schiex
ISCAS
2005
IEEE
136views Hardware» more  ISCAS 2005»
14 years 4 months ago
Economical passive filter synthesis using genetic programming based on tree representation
—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...
Hao-Sheng Hou, Shoou-Jinn Chang, Yan-Kuin Su
GECCO
2004
Springer
14 years 4 months ago
Multi-agent Cooperation Using Genetic Network Programming with Automatically Defined Groups
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...
Tadahiko Murata, Takashi Nakamura