نتایج جستجو برای: random knockout tournament
تعداد نتایج: 322315 فیلتر نتایج به سال:
In our previous study, we showed that the branching process approximation is useful for estimating metabolic robustness, measured using the impact degree. By applying a theory of random family forests, we here extend the branching process approximation to consider the knockout of multiple reactions, inspired by the importance of multiple knockouts reported by recent computational and experiment...
Balanced knockout tournaments are one of the most common formats for sports competitions, and are also used in elections and decision-making. We consider the computational problem of finding the optimal draw for a particular player in such a tournament. The problem has generated considerable research within AI in recent years. We prove that checking whether there exists a draw in which a player...
In this paper we use tournament matrices to give a combinatorial interpretation for the entries of the inverse t-Kostka matrix, which is the transition matrix between the Hall-Littlewood polyno-mials and the Schur functions. 0.1 Introduction In the rst section of this paper we introduce some basic notation about tournament matrices, and prove a theorem that is crucial in the second section. In ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید