Sciweavers

602 search results - page 78 / 121
» Unsupervised Problem Decomposition Using Genetic Programming
Sort
View
STACS
2005
Springer
14 years 4 months ago
Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms
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 ...
Petros Drineas, Ravi Kannan, Michael W. Mahoney
COR
2007
176views more  COR 2007»
13 years 11 months ago
Scheduling and routing of automated guided vehicles: A hybrid approach
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...
Ayoub Insa Corréa, André Langevin, L...
GECCO
2007
Springer
150views Optimization» more  GECCO 2007»
14 years 2 months ago
Overcoming hierarchical difficulty by hill-climbing the building block structure
The Building Block Hypothesis suggests that Genetic Algorithms (GAs) are well-suited for hierarchical problems, where efficient solving requires proper problem decomposition and a...
David Iclanzan, Dan Dumitrescu
CRV
2006
IEEE
137views Robotics» more  CRV 2006»
14 years 5 months ago
Evolving a Vision-Based Line-Following Robot Controller
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...
Jean-François Dupuis, Marc Parizeau
SAC
2003
ACM
14 years 4 months ago
Can a Parser be Generated from Examples?
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...
Marjan Mernik, Goran Gerlic, Viljem Zumer, Barrett...