Filters








1,543 Hits in 3.8 sec

Page 5169 of Mathematical Reviews Vol. , Issue 2004g [page]

2004 Mathematical Reviews  
The cost of finding a sorted sequence of kings is the minimum number of binary questions asked in order to guarantee the finding of a sorted sequence of kings.  ...  Reid (1-CASSM; San Marcos, CA) 20042:05069 05C20 Ho, Ting-Yem; Chang, Jou-Ming Sorting a sequence of strong kings in a tournament. (English summary) Inform. Process. Lett. 87 (2003), no. 6, 317-320.  ... 

ON COST-OPTIMAL MERGE OF TWO INTRANSITIVE SORTED SEQUENCES

JIE WU, STEPHEN OLARIU
2003 International Journal of Foundations of Computer Science  
The problem of merging two i n transitive sorted sequences (that is, to generate a sorted total order without the transitive p r o p e r t y) is considered.  ...  The cost-optimal merge in the strong sense is still an open problem.  ...  It has been proved that the sorted sequence of kings exists in any tournament a n d a n O(n 2 ) solution based in a modi ed insertion sort is given in 8].  ... 
doi:10.1142/s0129054103001613 fatcat:b6lg3bpz3zaf7altwpeqqcjizm

On cost-optimal merge of two intransitive sorted sequences

Jie Wu, S. Olariu
2002 Proceedings 16th International Parallel and Distributed Processing Symposium  
The problem of merging two i n transitive sorted sequences (that is, to generate a sorted total order without the transitive p r o p e r t y) is considered.  ...  The cost-optimal merge in the strong sense is still an open problem.  ...  It has been proved that the sorted sequence of kings exists in any tournament a n d a n O(n 2 ) solution based in a modi ed insertion sort is given in 8].  ... 
doi:10.1109/ipdps.2002.1016545 dblp:conf/ipps/WuO02 fatcat:jvejzbxa7bggtparathqppfbay

A common-opponent stochastic model for predicting the outcome of professional tennis matches

William J. Knottenbelt, Demetris Spanias, Agnieszka M. Madurska
2012 Computers and Mathematics with Applications  
The rise of the internet has stimulated a dramatic increase in tennis-related financial activity, much of which depends on quantitative models.  ...  Crucially, the model provides a fair basis of comparison between players by analysing match statistics for opponents that both players have encountered in the past.  ...  Tennis is an ideal candidate for a hierarchical model as a match consists of a sequence of sets, which in turn consist of a sequence of games, which in turn consist of a sequence of points.  ... 
doi:10.1016/j.camwa.2012.03.005 fatcat:z5xczptjozecxoyc6owhidh6am

Page 73 of The Speaker. The Liberal Review Vol. 11, Issue [page]

1895 The Speaker. The Liberal Review  
says a distinguished light of the Germanic Con- federation, which is strong in our club.  ...  Arthur should smile—as he did in Malory. “ King Arthur loved Sir Bagonet, and made him knight with his own hands. And at every tournament he began to make King Arthur to laugh.”  ... 

The King Chicken Theorems

Stephen B. Maurer
1980 Mathematics Magazine  
15:41 UTC JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive.  ...  We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact support@jstor.org.  ...  It can be proved using the fact that each so-called strong tournament contains a cycle which passes through all the vertices and the fact that most tournaments are strong.  ... 
doi:10.2307/2689952 fatcat:tqtw6oo7pbdejnya62ogkig2t4

Evaluation of Economy in a Zero-sum Perfect Information Game

A. Iqbal
2007 Computer journal  
For this purpose, Western or International chess was the most suitable because there is a strong body of literature on the subject, including its aesthetic aspect.  ...  Eight principles of aesthetics were identified and formalizations derived for each to form a cumulative model of aesthetics.  ...  They have been sorted in descending order for clarity. The compositions scored an aesthetic mean of 3.04 (SD 1.05) whereas the tournament games scored a mean of 1.92 (SD 0.94).  ... 
doi:10.1093/comjnl/bxm060 fatcat:ffkgfkugbnd4xp3tz2xh53esoy

Evolutionary-based heuristic generators for checkers and give-away checkers

Jacek Mańdziuk, Magdalena Kusiak, Karol Walędzik
2007 Expert systems  
Hence explicit fitness function is not necessary in this case and direct comparison between heuristics (a tournament) can be used instead.  ...  Two methods of genetic evolution of linear and non-linear heuristic evaluation functions for the game of checkers and give-away checkers are presented in the paper.  ...  Basing on the relation described above, it was relatively easy to compare and sort specimens within a small set and, subsequently, perform a tournament selection without any fitness function whatsoever  ... 
doi:10.1111/j.1468-0394.2007.00429.x fatcat:iutqmwygdfd3rowjxnq6phyh3y

Robust bounds on choosing from large tournaments

Christian Saile, Warut Suksompong
2019 Social Choice and Welfare  
Tournament solutions provide methods for selecting the "best" alternatives from a tournament and have found applications in a wide range of areas.  ...  Nevertheless, all analytical results thus far have assumed a rigid probabilistic model, in which either a tournament is chosen uniformly at random, or there is a linear order of alternatives and the orientation  ...  A preliminary version of the paper appeared in Proceedings of the 14th Conference on Web and Internet Economics.  ... 
doi:10.1007/s00355-019-01213-6 pmid:32055084 pmcid:PMC6989623 fatcat:j4dydcwnvrgmpfpgttej5jbdvm

Improving Ranking Quality and Fairness in Swiss-System Chess Tournaments [article]

Pascal Führlich, Ágnes Cseh, Pascal Lenzner
2021 arXiv   pre-print
We demonstrate by extensive experiments that a tournament format using our mechanism 1) yields fairer pairings in the rounds of the tournament and 2) produces a final ranking that reflects the players'  ...  The International Chess Federation (FIDE) imposes a voluminous and complex set of player pairing criteria in Swiss-system chess tournaments and endorses computer programs that are able to calculate the  ...  Fixing tournaments Biró, P.; Fleiner, T.; and Palincza, R. 2017. Designing chess for kings, chokers, and more. In Proceedings of the 24th pairing mechanisms.  ... 
arXiv:2112.10522v1 fatcat:ptz7xxvp6jbcpb5qqwneagzq2u

Robust Bounds on Choosing from Large Tournaments [article]

Christian Saile, Warut Suksompong
2018 arXiv   pre-print
Tournament solutions provide methods for selecting the "best" alternatives from a tournament and have found applications in a wide range of areas.  ...  Nevertheless, all analytical results thus far have assumed a rigid probabilistic model, in which either a tournament is chosen uniformly at random, or there is a linear order of alternatives and the orientation  ...  A preliminary version of the paper appeared in Proceedings of the 14th Conference on Web and Internet Economics.  ... 
arXiv:1804.02743v2 fatcat:44jjbzw2lbcghcb6grzgrbippi

Page 231 of Leslie's Weekly Vol. 78, Issue 2012 [page]

1894 Leslie's Weekly  
The outfield is strong, however, and Captain Stearns at sec- base is as good as King; think the Amherst the more valuable.  ...  Three or four heavy, strong men with even a slight knowledge of rowing would be very welcome in Cambridge.  ... 

Ivanhoe and the teacher. I

A WORMHOUDT
1953 American Imago  
of this sort of approach to literature.  ...  At the same time the castle is being attacked from with- out by a band of Robin Hood’s men, some of the Saxon people and King Richard in disguise.  ... 
pmid:13040279 fatcat:32fl2t6kvbav5ibfnukizir2hy

The Complexity of Finding Top-Toda-Equivalence-Class Members

Lane A. Hemaspaandra, Mitsunori Ogihara, Mohammed J. Zaki, Marius Zimand
2005 Theory of Computing Systems  
Informally, it always places a bet on one of them being in the set, and it wins whenever winning such a bet is possible.  ...  the algorithm * has the property that if at least one of x or y is in A, then the one the algorithm outputs belongs to A.  ...  Acknowledgments: We are grateful to A. Kaplan and B. Serog for helpful conversations, to R.  ... 
doi:10.1007/s00224-005-1211-9 fatcat:2ory22scvzg6bgqpnd3dz3hagm

The Complexity of Finding Top-Toda-Equivalence-Class Members [chapter]

Lane A. Hemaspaandra, Mitsunori Ogihara, Mohammed J. Zaki, Marius Zimand
2004 Lecture Notes in Computer Science  
Informally, it always places a bet on one of them being in the set, and it wins whenever winning such a bet is possible.  ...  the algorithm * has the property that if at least one of x or y is in A, then the one the algorithm outputs belongs to A.  ...  Acknowledgments: We are grateful to A. Kaplan and B. Serog for helpful conversations, to R.  ... 
doi:10.1007/978-3-540-24698-5_13 fatcat:nhcdypwtgjcxhaqhspzarrhcui
« Previous Showing results 1 — 15 out of 1,543 results