Sciweavers

1725 search results - page 18 / 345
» Relaxed genetic programming
Sort
View
NETWORKS
2008
13 years 8 months ago
New dynamic programming algorithms for the resource constrained elementary shortest path problem
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
Giovanni Righini, Matteo Salani
EUROGP
2007
Springer
135views Optimization» more  EUROGP 2007»
14 years 3 months ago
A Grammatical Genetic Programming Approach to Modularity in Genetic Algorithms
The ability of Genetic Programming to scale to problems of increasing difficulty operates on the premise that it is possible to capture regularities that exist in a problem environ...
Erik Hemberg, Conor Gilligan, Michael O'Neill, Ant...
CPAIOR
2006
Springer
14 years 15 days ago
A Totally Unimodular Description of the Consistent Value Polytope for Binary Constraint Programming
Abstract. We present a theoretical study on the idea of using mathematical programming relaxations for filtering binary constraint satisfaction problems. We introduce the consisten...
Ionut D. Aron, Daniel H. Leventhal, Meinolf Sellma...
AAAI
1992
13 years 10 months ago
Automatic Programming of Robots Using Genetic Programming
The goal in automatic programming is to get a computer to perform a task by telling it what needs to be done, rather than by explicitly programming it. This paper considers the ta...
John R. Koza, James Rice
GPEM
2000
126views more  GPEM 2000»
13 years 8 months ago
Automatic Creation of Human-Competitive Programs and Controllers by Means of Genetic Programming
Genetic programming is an automatic method for creating a computer program or other complex structure to solve a problem. This paper first reviews various instances where genetic p...
John R. Koza, Martin A. Keane, Jessen Yu, Forrest ...