Neural Networks and Rules-based Systems used to Find Rational and Scientific Correlations between being Here and Now with Afterlife Conditions
Neural Networks and Rules-based Systems used to Find Rational and
Article Fingerprint
ReserarchID
XBK39
The problem of ranking players in a round-robin tournament, in which outcome of any match is a win or a loss, is to rank players according to their performances in the tournament. In this paper, we have improved previously developed MST (Majority Spanning Tree) algorithm for solving this problem, where the number of violations has been chosen as the criterion of optimality. We have compared the performance of our algorithm with the MST algorithm and GIK algorithm.
Raghad Rowaida. 2017. \u201cA New Ranking Algorithm for A Round-Robin Tournament\u201d. Global Journal of Computer Science and Technology - G: Interdisciplinary GJCST-G Volume 17 (GJCST Volume 17 Issue G2): .
Crossref Journal DOI 10.17406/gjcst
Print ISSN 0975-4350
e-ISSN 0975-4172
The methods for personal identification and authentication are no exception.
The methods for personal identification and authentication are no exception.
Total Score: 102
Country: Bangladesh
Subject: Global Journal of Computer Science and Technology - G: Interdisciplinary
Authors: Raghad Rowaida, Afsana Ahmed Munia (PhD/Dr. count: 0)
View Count (all-time): 252
Total Views (Real + Logic): 6219
Total Downloads (simulated): 1516
Publish Date: 2017 11, Mon
Monthly Totals (Real + Logic):
Neural Networks and Rules-based Systems used to Find Rational and
A Comparative Study of the Effeect of Promotion on Employee
The Problem Managing Bicycling Mobility in Latin American Cities: Ciclovias
Impact of Capillarity-Induced Rising Damp on the Energy Performance of
The problem of ranking players in a round-robin tournament, in which outcome of any match is a win or a loss, is to rank players according to their performances in the tournament. In this paper, we have improved previously developed MST (Majority Spanning Tree) algorithm for solving this problem, where the number of violations has been chosen as the criterion of optimality. We have compared the performance of our algorithm with the MST algorithm and GIK algorithm.
We are currently updating this article page for a better experience.
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.