2310 search results - page 5 / 462 » The selection efficiency of tournaments |
COMBINATORICS
2000
13 years 7 months ago
2000
Two tournaments T1 and T2 on the same vertex set X are said to be switching equivalent if X has a subset Y such that T2 arises from T1 by switching all arcs between Y and its comp...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
This paper investigates the ability of a tournament selection based genetic algorithm to find mutationally robust solutions to a simple combinatorial optimization problem. Two di...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
The TAC SCM tournament is moving into its fourth year. In an effort to track agent progress, we present a benchmark market efficiency comparison for the tournament, in addition to ...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
We analyze generalization and learning in XCS with gradient descent. At first, we show that the addition of gradient in XCS may slow down learning because it indirectly decreases...
EC
2008
13 years 6 months ago
2008
A wide range of niching techniques have been investigated in evolutionary and genetic algorithms. In this article, we focus on niching using crowding techniques in the context of ...