Results 41 to 50 of about 68,433 (283)
Discrete Applied Mathematics, 1997 Let \(T\) be a tournament of order \(n\). If \(T\) is 3-connected and each arc of \(T\) is contained in a cycle of length 3, then every arc of \(T\) has a bypath of length \(k\), for each \(k\) with \(3 \leq k \leq n-1\), unless \(T\) is isomorphic to two tournaments, each of which is of order 8.
Yubao Guo, Lutz Volkmann
openaire +3 more sources
Journal of Combinatorial Theory, Series B, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Asaf Shapira, Raphael Yuster
openaire +2 more sources
On Tournaments and negative dependence
Journal of Applied Probability, 2023 AbstractNegative dependence of sequences of random variables is often an interesting characteristic of their distribution, as well as a useful tool for studying various asymptotic results, including central limit theorems, Poisson approximations, the rate of increase of the maximum, and more.
Yaakov Malinovsky, Yosef Rinott
openaire +2 more sources
Algorithms, 2019 We study the selection problem, namely that of computing the ith order statistic of n given elements. Here we offer a data structure called selectable sloppy heap that handles a dynamic version in which upon request (i) a new element is inserted or (ii ...
Adrian Dumitrescu
doaj +1 more source
Randomness, uncertainty, and the optimal college football championship tournament size
Journal of Sports Analytics, 2023 Every year, there is a popular debate over how many teams should take part in the NCAA’s FBS-level college football championship tournament, and especially whether it should be expanded from 4 teams to 8 or even 12.
Grace Muller, Samuel Hood, Joel Sokol
doaj +1 more source
Advanced Science, EarlyView.To accelerate the inverse design of heterostructured metal matrix composites, a closed‐loop scientific machine learning framework integrates continual learning prediction with NSGA‐II‐PMCP optimization. The framework maps microstructural descriptors to strength, toughness, and modulus, expands high‐quality Pareto solutions, and guides experimentally ...
Zhiyan Zhong +11 more
wiley +1 more source
The Dichromatic Number of Infinite Families of Circulant Tournaments
Discussiones Mathematicae Graph Theory, 2017 The dichromatic number dc(D) of a digraph D is defined to be the minimum number of colors such that the vertices of D can be colored in such a way that every chromatic class induces an acyclic subdigraph in D.
Javier Nahid, Llano Bernardo
doaj +1 more source
Closing the Empirical Loop: Autonomous AI Agents Conduct End‐to‐end Research With Human Participants
Advanced Science, EarlyView.A multi‐agent AI system autonomously executes the complete scientific workflow, from hypothesis to manuscript, across three psychological studies involving 288 participants. The system designs experiments, collects real world data, develops analysis pipelines, and writes manuscripts with theoretical rigor comparable to experienced researchers.
Gabrielle Wehr +6 more
wiley +1 more source
International Journal of Computer Science in Sport, 2023 Simulating and predicting tournament outcomes has become an increasingly popular research topic. The outcomes can be influenced by several factors, such as attack, defence and home advantage strength values, as well as tournament structures. However, the
Khalid Ruzelan +3 more
doaj +1 more source
LLM‐Based Scientific Assistants for Knowledge Extraction: Which Design Choices Matter?
Advanced Intelligent Discovery, EarlyView.A comprehensive framework for optimizing Large Language Models in domain‐specific applications is introduced. The LLM Playground integrates Prompt Engineering, knowledge augmentation, and advanced reasoning strategies to enable systematic comparison of architectures and base models.
David Exler +7 more
wiley +1 more source