نتایج جستجو برای: random knockout tournament

تعداد نتایج: 322315  

2005
Kam-Fai Wong Louise Guthrie Wei Liu Yunqing Xia

The tournament text classification methods are proposed in this article to perform the task of email categorization, in which the essence is to break down the multi-class categorization process into a set of binary classification tasks. We implement the methods of elimination and Round Robin tournament to classify emails within 15 folders. Substantial experiments are conducted to compare the ef...

Journal: :Combinatorics, Probability & Computing 2015
Michael Krivelevich Matthew Kwan Benny Sudakov

We give several results showing that different discrete structures typically gain certain spanning substructures (in particular, Hamilton cycles) after a modest random perturbation. First, we prove that adding linearly many random edges to a dense k-uniform hypergraph ensures the (asymptotically almost sure) existence of a perfect matching or a loose Hamilton cycle. The proof involves a nonstan...

2006
Vikraman Arvind Bireswar Das Partha Mukhopadhyay

We give a polynomial-time oracle algorithm for Tournament Canonization that accesses oracles for Tournament Isomorphism and Rigid-Tournament Canonization. Extending the Babai-Luks Tournament Canonization algorithm, we give an n n) algorithm for canonization and isomorphism testing of k-hypertournaments, where n is the number of vertices and k is the size of hyperedges.

Journal: :J. Comb. Theory, Ser. B 2001
Guantao Chen Ronald J. Gould Hao Li

This article will generally follow the notation and terminology defined in [1]. A digraph is called strongly connected or strong if for every pari of vertices u and v there exists a directed path from u to v and a directed path from v to u. Let k be a positive integer. A digraph G is k-connected if the removal of any set of fewer than k vertices results in a strong digraph. A tournament with n ...

2013
Kevin J. Boudreau Constance E. Helfat Karim R. Lakhani Michael Menietti

Tournaments are widely used in the economy to organize production and innovation. We study individual contestant-level data on 2796 contestants in 774 software algorithm design contests with random assignment. Precisely conforming to theory predictions, the performance response to added contestants varies non-monotonically across contestants of different abilities; most respond negatively to co...

1986
PETER ROWLINSON

First, some definitions. A tournament is regular of degree k if each point has indegree k and outdegree k: clearly such a tournament has 2k +1 points. The trivial tournament has just one point. A tournament T is doubly regular with subdegree t if it is non-trivial and any two points of T jointly dominate precisely t points; equivalently if T is non-trivial and for each point v of T, the subtour...

Journal: :Journal of sports analytics 2021

In 2026, the FIFA World Cup will for first time gather 48 men’s national teams. It consist of a group stage made 16 groups three, with best two teams in each advancing to knockout stage. Using three raises several fairness issues, including risk match fixing and schedule imbalance. this article we examine collusion. The who play last game know exactly what results let them advance Risk occurs w...

Journal: :Computers & Operations Research 2022

Tournaments are a widely used mechanism to rank alternatives in noisy environment. This paper investigates fundamental issue of economics tournament design: what is the best usage limited resources, that is, how should be compared pairwise approximate their true but latent ranking. We consider various formats including knockout tournaments, multi-stage championships consisting round-robin group...

2008
Ryuhei MIYASHIRO Tomomi MATSUI Shinji IMAHORI Ryuhei Miyashiro Tomomi Matsui Shinji Imahori R. Miyashiro T. Matsui S. Imahori

This paper deals with the traveling tournament problem, which is a well-known benchmark problem in the field of tournament timetabling. We propose a new lower bound for the traveling tournament problem, and construct a randomized approximation algorithm yielding a feasible solution whose approximation ratio is less than 2+(9/4)/(n−1), where n is the number of teams. For the traveling tournament...

Journal: :Eur. J. Comb. 2018
Erik Thörnblad

The theory of tournament limits and tournament kernels (often called graphons) is developed by extending common notions for finite tournaments to this setting; in particular we study transitivity and irreducibility of limits and kernels. We prove that each tournament kernel and each tournament limit can be decomposed into a direct sum of irreducible components, with transitive components interl...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید