602 search results - page 78 / 121 » Unsupervised Problem Decomposition Using Genetic Programming |
136
click to vote
STACS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
162
click to vote
COR
2007
15 years 4 months ago
2007
We propose a hybrid method designed to solve a problem of dispatching and conflict free routing of automated guided vehicles (AGVs) in a flexible manufacturing system (FMS). Thi...
132
click to vote
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
The Building Block Hypothesis suggests that Genetic Algorithms (GAs) are well-suited for hierarchical problems, where efficient solving requires proper problem decomposition and a...
128
Voted
CRV
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper presents an original framework for evolving a vision-based mobile robot controller using genetic programming. This framework is built on the Open BEAGLE framework for t...
133
click to vote
SAC
2003
ACM
15 years 9 months ago
2003
ACM
One of the open problems in the area of domain-specific languages is how to make domain-specific language development easier for domain experts not versed in a programming languag...