Transitive tournament (including transitive triangle) and its blow-up have some symmetric properties. In this work, we establish an analogue result of the Erdös-Stone theorem weighted digraphs with a forbidden tournament. We give stability oriented graphs triangles show that almost all are bipartite, which reconfirms strengthens conjecture Cherlin.

In this paper a method is presented that decreases the necessary number of evaluations in Evolutionary Algorithms. A classifier with confidence information is evolved to replace time consuming evaluations during tournament selection. Experimental analysis of a mathematical example and the application of the method to the problem of evolving walking patterns for quadruped robots show the potenti...

This paper analyzes the dynamics of a new selection scheme based on altruistic cooperation between individuals. The scheme, which we refer to as cooperative selection, extends from tournament selection and imposes a stringent restriction on the mating chances of an individual during its lifespan: winning a tournament entails a depreciation of its fitness value. We show that altruism minimizes t...

The purpose of the study was to specify the changes in blood glucose concentrations in the course of repeated tournament and practice matches, and to quantify the Incidence of hypoglycaemia in elite tennis players. The study consisted of two parts. In the first, 147 tournament players completed a questionnaire about the incidence of hypoglycaemic symptoms during repeated tennis matches. In the ...

Promotions and Incentives: The Case of Multi-Stage Elimination Tournaments Promotion tournaments play an important role for the provision of incentives in firms. In this paper, we extend research on single-stage rank-order tournaments and analyze behavior in multi-stage elimination tournaments. The main treatment of our laboratory experiment is a two-stage tournament in which equilibrium effort...

Selection pressure controls the selection of individuals from the current population to produce a new population in the next generation. It gives individuals of higher quality a higher probability of being used to create the next generation so that Evolutionary Algorithms (EAs) can focus on promising regions in the search space. An evolutionary learning process is dynamic and requires different...

We show that Z-cyclic splittable triplewhist tournament designs exist for all primes of the form p = 8t + 1, t odd, except possibly p = 41.

Tournament selection has been widely used and studied in evolutionary algorithms. The size of tournament is a crucial parameter for this method. It influences on the algorithm convergence, the population diversity and the solution quality. This paper presents a new technique to adjust this parameter dynamically using fuzzy unsupervised learning. The efficiency of the proposed technique is shown...