3455 search results - page 604 / 691 » Generalized Game Trees |
159
click to vote
CP
2006
Springer
15 years 8 months ago
2006
Springer
Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. I...
162
click to vote
CPM
2006
Springer
15 years 8 months ago
2006
Springer
The Range-Minimum-Query-Problem is to preprocess an array such that the position of the minimum element between two specified indices can be obtained efficiently. We present a dire...
143
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
A boosting algorithm based on cellular genetic programming to build an ensemble of predictors is proposed. The method evolves a population of trees for a fixed number of rounds an...
124
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
The population size in evolutionary computation is a significant parameter affecting computational effort and the ability to successfully evolve solutions. We find that population...
138
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
In contrast with the diverse array of genetic algorithms, the Genetic Programming (GP) paradigm is usually applied in a relatively uniform manner. Heuristics have developed over t...