13841 search results - page 2343 / 2769 » Algorithms and Constraint Programming |
150
Voted
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
This study reports the work to date on the analysis of different methodologies for constant creation with the aim of applying the most advantageous method to the dynamic real wor...
148
Voted
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
This study examines the utility of meta-grammar constant generation on a series of benchmark problems. The performance of the meta-grammar approach is compared to a grammar which ...
105
Voted
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
Evaluating GP schema in context is considered to be a complex, and, at times impossible, task. The tightly linked nodes of a GP tree is the main reason behind its complexity. This...
130
Voted
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
A number of recent studies introduced meta-evolutionary strategies and successfully used them for solving problems in genetic programming. While individual results indicate possib...
131
Voted
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract: The quantum adversary method is one of the most versatile lower-bound methods for quantum algorithms. We show that all known variants of this method are equivalent: spect...