The accuracy-based fitness approach in XCS is one of the most significant changes in comparison with original learning classifier systems. Nonetheless, neither the scaled accuracy function, nor the importance of the relative fitness approach has been investigated in detail. The recent introduction of tournament selection to XCS has shown to make the system more independent from parameter settin...

—The mortality of fish captured in fishing tournaments has commonly been estimated incorrectly and, thus far, only one account has presented an estimate of the standard error or confidence interval for tournament-associated mortality. In this article we describe methods for estimating the initial, delayed, and total mortality of tournament-caught fish and provide formulae for estimating the sam...

We prove that in almost all large tournaments, the minimal covering set is the entire set of alternatives. That is, as the number of alternatives gets large, the probability that the minimal covering set of a uniformly chosen random tournament is the entire set of alternatives goes to one. By contrast, it follows from a result of Fisher and Reeves (1995) that the bipartisan set contains about h...

Genetic algorithm is a search algorithm based on the mechanics of natural selection and natural genetics. The purpose of this master thesis is to optimize/maximize de Jong’s function1 in GA using different selection schemes (like roulette wheel,random selection, besy fit/elitist fit rank selection, tournament selection). For our problem the fitness function chosen is from literature of benchmar...

We show that a random walk on a tournament on n vertices finds either a sink or a 3-cycle in expected time O (√ n · log n · √ log∗ n ) , that is, sublinear both in the size of the description of the graph as well as in the number of vertices. This result is motivated by the search of a generic algorithm for solving a large class of search problems called Local Search, LS. LS is defined by us as...

An orientation of a complete graph is a tournament, and an orientation of a complete n-partite graph is an n-partite tournament. For each n 2:: 4, there exist examples of strongly connected n-partite tournament without any strongly connected subtournaments of order p 2:: 4. If D is a digraph, then let d+ (x) be the out degree and d(x) the indegree of the vertex x in D. The minimum (maximum) out...

This paper presents a model to predict the convergence quality of genetic algorithms based on the size of the population. The model is based on an analogy between selection in GAs and one-dimensional random walks. Using the solution to a classic random walk problem-the gambler's ruin-the model naturally incorporates previous knowledge about the initial supply of building blocks (BBs) and correc...

Competitive high ranking positions are largely occupied by men, and women remain scarce in engineering and sciences. Explanations for these occupational differences focus on discrimination and preferences for work hours and field of study. We explore an additional explanation, namely that women and men may differ in their selection into competitive environments. Men and women in a laboratory ex...

The purpose of this study was to: a) identify changes in jump height and perceived well-being as indirect markers of fatigue, b) determine the internal and external workloads performed by players, and c) examine the influence of Yo-Yo IR2 on changes in jump height, perceived well-being and internal and external workloads during a tag football tournament. Microtechnology devices combined with he...