Sciweavers

169 search results - page 10 / 34
» Fine-Grained Timing Using Genetic Programming
Sort
View
GECCO
2010
Springer
249views Optimization» more  GECCO 2010»
13 years 12 months ago
Towards improved dispatching rules for complex shop floor scenarios: a genetic programming approach
Developing dispatching rules for manufacturing systems is a tedious process, which is time- and cost-consuming. Since there is no good general rule for different scenarios and ob...
Torsten Hildebrandt, Jens Heger, Bernd Scholz-Reit...
GECCO
2000
Springer
122views Optimization» more  GECCO 2000»
14 years 1 months ago
Genetic Programming with Statically Scoped Local Variables
This paper presents an extension to genetic programming to allow the evolution of programs containing local variables with static scope which obey the invariant that all variables...
Evan Kirshenbaum
ACSW
2004
13 years 11 months ago
Applying Online Gradient Descent Search to Genetic Programming for Object Recognition
This paper describes an approach to the use of gradient descent search in genetic programming (GP) for object classification problems. In this approach, pixel statistics are used ...
William D. Smart, Mengjie Zhang
EUROGP
2001
Springer
110views Optimization» more  EUROGP 2001»
14 years 2 months ago
General Schema Theory for Genetic Programming with Subtree-Swapping Crossover
Abstract. In this paper a new, general and exact schema theory for genetic programming is presented. The theory includes a microscopic schema theorem applicable to crossover operat...
Riccardo Poli
GECCO
2005
Springer
151views Optimization» more  GECCO 2005»
14 years 3 months ago
Backward-chaining genetic programming
Tournament selection is the most frequently used form of selection in genetic programming (GP). Tournament selection chooses individuals uniformly at random from the population. A...
Riccardo Poli, William B. Langdon