نتایج جستجو برای: tournament
تعداد نتایج: 3256 فیلتر نتایج به سال:
The Pinehurst Terrapin Classic (PTC) is a five day, 16 player, annual golf tournament that includes match-play and scramble rounds. Pairings must be created for each day of the tournament that ensure each pair of participants play on the same team at least once during the tournament, and ensure that the teams for each scramble round are of comparable ability. Over the past four years, both a si...
I this paper, we study the performance of a sourcing mechanism gaining popularity in industrial procurement environments; a tournament. Under a tournament, a buyer initially procures her parts from two suppliers with possibly different quality levels, for T time periods, i.e., she parallel sources. During this time, the buyer is able to observe noisy signals about the suppliers’ quality. At tim...
A sport tournament problem is considered the Traveling Tournament Problem (TTP). One interesting type is the mirrored Traveling Tournament Problem (mTTP). The objective of the problem is to minimize either the total number of traveling or the total distances of traveling or both. This research aims to find an optimized solution of the mirrored Traveling Tournament Problem with minimum total num...
The score sequence of a tournament is the out-degrees its vertices arranged in nondecreasing order. problem counting sequences with n n more ...
A tournament is an oriented complete graph. There are many conditions that assure that a non increasing sequence s1 ≥ s2 ≥ ... ≥ sn are the scores (out degrees) of the vertices of a tournament. Furthermore, given a realizable score sequence, there are possibly many tournaments that have that sequence as its score sequence. In this paper we explore the existence of realizations of a sequence hav...
Recent research has found drastic differences across gender in how performance and preferences are affected by competition. In light of these, this study addresses how gender affects the use of competitive compensation. When given information about worker ability, male managers, but not female managers, are reluctant to choose the tournament for a female worker. The data also show that even tho...
This note describes a selection procedure for genetic algorithms called Boltzmann tournament selection. As simulated annealing evolves a Boltzmann distribution in time using the Metropolis algorithm or a logistic acceptance mechanism, Boltzmann tournament selection evolves a Boltzmann distribution across a population and time using pairwise probabilistic acceptance and anti-acceptance mechanism...
In voting theory, the result of a paired comparison method as the one suggested by Condorcet can be represented by a tournament, i.e., a complete asymmetric directed graph. When there is no Condorcet winner, i.e., a candidate preferred to any other candidate by a majority of voters, it is not always easy to decide who is the winner of the election. Different methods, called tournament solutions...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید