Sciweavers

873 search results - page 8 / 175
» Tournament scoring problem
Sort
View
COMBINATORICS
2000
72views more  COMBINATORICS 2000»
13 years 9 months ago
Tournament Sequences and Meeussen Sequences
A tournament sequence is an increasing sequence of positive integers (t1, t2, . . .) such that t1 = 1 and ti+1 2ti. A Meeussen sequence is an increasing sequence of positive inte...
Matthew Cook, Michael Kleber
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
WAOA
2010
Springer
275views Algorithms» more  WAOA 2010»
13 years 7 months ago
Online Ranking for Tournament Graphs
We study the problem of producing a global ranking of items given pairwise ranking information, when the items to be ranked arrive in an online fashion. We study both the maximizat...
Claire Mathieu, Adrian Vladu
MLDM
2009
Springer
14 years 4 months ago
Dynamic Score Combination: A Supervised and Unsupervised Score Combination Method
In two-class score-based problems the combination of scores from an ensemble of experts is generally used to obtain distributions for positive and negative patterns that exhibit a ...
Roberto Tronci, Giorgio Giacinto, Fabio Roli
GECCO
2003
Springer
129views Optimization» more  GECCO 2003»
14 years 3 months ago
Tournament Selection: Stable Fitness Pressure in XCS
Abstract. Although it is known from GA literature that proportionate selection is subject to many pitfalls, the LCS community somewhat adhered to proportionate selection. Also in t...
Martin Butz, Kumara Sastry, David E. Goldberg