38 search results - page 5 / 8 » On Complexity of Optimized Crossover for Binary Representati... |
GECCO
2007
Springer
13 years 10 months ago
2007
Springer
This paper introduces a function that increases the amount of neutrality (inactive code in Genetic Programming) for the Artificial Ant Problem. The objective of this approach is t...
HM
2010
Springer
13 years 6 months ago
2010
Springer
In this paper we consider solving a complex real life break scheduling problem. This problem of high practical relevance arises in many working areas, e.g. in air traffic control a...
GECCO
2007
Springer
13 years 10 months ago
2007
Springer
The learning in a niche based learning classifier system depends both on the complexity of the problem space and on the number of available actions. In this paper, we introduce a ...
APIN
2000
13 years 5 months ago
2000
Genetic algorithms are adaptive methods based on natural evolution that may be used for search and optimization problems. They process a population of search space solutions with t...
CVPR
2010
IEEE
14 years 8 days ago
2010
IEEE
We present a method for real-time 3D object detection
that does not require a time consuming training stage, and
can handle untextured objects. At its core, is a novel tem-
plat...