Results 81 to 90 of about 67,579,596 (150)

Twelve Challenges for Scaling Teamwork Processes

AI Magazine, Volume 47, Issue 3, Fall 2026.
Abstract As we survey and celebrate the unprecedented growth and deployment of AI and robotics, we are concerned that current efforts are overly focused on merely increasing the numbers of fielded systems and the proportion of individuals who use them.
Matthew Johnson, Jeffrey M. Bradshaw
wiley   +1 more source

Mini-Workshop: Combinatorics on Words [PDF]

, 2010
The area of combinatorics on words is concerned with properties of sequences of symbols. It is characteristic to the field that questions arise from various mathematical problems, and hence, many fundamental results on words have been established in ...

core   +2 more sources

Words and Numbers: A Dynamical Systems Perspective

Axioms
Along with some known and less known results, we discuss new insights relating combinatorics of words and the ordering of rationals from a dynamical systems point of view, somehow continuing along the path started in previous works of the first author ...
Stefano Isola, Francesco Marchionni
doaj   +1 more source

Machine Learning for Synthetic Organic Chemistry: Methods, Applications, and Best Practices

Angewandte Chemie Novit, Volume 2, Issue 3, September 2026.
Artificial intelligence (AI) and machine learning (ML) are increasingly reshaping experimental chemistry. This review maps the challenges of synthetic organic chemistry to modern digital tools that can help address them. While focusing on the practical application of ML tools in real‐world laboratory settings, we outline prerequisites, emerging ...
Niklas Hölter, Felix Katzenburg, Florian Boser, Frank Glorius   +3 more
wiley   +1 more source

BWT and Combinatorics on Words.

The Burrows-Wheeler Transform (BWT) is a reversible transformation on words (strings) introduced in 1994 in the context of data compression, which is a permutation of the characters in the word. Its clustering effect, i.e., the remarkable property of grouping identical characters (BWT runs) when they share common contexts, has made it a powerful tool ...
Gabriele Fici, Sabrina Mantaci, Antonio Restivo, Giuseppe Romana, Giovanna Rosone, Marinella Sciortino   +5 more
openaire   +3 more sources

Algorithmic complexity of protein identification: combinatorics of weighted strings [PDF]

, 2004
Cieliebak M, Erlebach T, Lipták Z, Stoye J, Welzl E. Algorithmic complexity of protein identification: combinatorics of weighted strings. Discrete Applied Mathematics.
Lipták, Zsuzsanna, Welzl, Emo, Jens Stoye, Stoye, Jens, Erlebach, Thomas, Stoye, Jens ; https://orcid.org/, Mark Cieliebak, Thomas Erlebach, Emo Welzl, Cieliebak, Mark   +9 more
core   +1 more source

On Tight Tree‐Complete Hypergraph Ramsey Numbers

Journal of Graph Theory, Volume 113, Issue 1, Page 88-96, September 2026.
ABSTRACT Chvátal showed that for any tree T with k edges, the Ramsey number R ( T , n ) = k ( n − 1 ) + 1. For r = 3 or 4, we show that, if T is an r‐uniform nontrivial tight tree, then the hypergraph Ramsey number R ( T , n ) = Θ ( n r − 1 ). The 3‐uniform result comes from observing a construction of Cooper and Mubayi.
Jiaxi Nie
wiley   +1 more source

Orientations of Graphs With at Most One Directed Path Between Every Pair of Vertices

Journal of Graph Theory, Volume 113, Issue 1, Page 143-164, September 2026.
ABSTRACT Given a graph G, we say that an orientation D of G is a KT orientation if, for all u , v ∈ V ( D ), there is at most one directed path (in any direction) between u and v. Graphs that admit such orientations have been used to construct graphs with large chromatic number and small clique number that served as counterexamples to various ...
Barbora Dohnalová, Jiří Kalvoda, Gaurav Kucheriya, Sophie Spirkl   +3 more
wiley   +1 more source

Note on decipherability of three-word codes

International Journal of Mathematics and Mathematical Sciences, 2002
The theory of uniquely decipherable (UD) codes has been widely developed in connection with automata theory, combinatorics on words, formal languages, and monoid theory.
F. Blanchet-Sadri, T. Howell
doaj   +1 more source

Majority Dynamics on Finite Trees

Random Structures &Algorithms, Volume 69, Issue 2, September 2026.
ABSTRACT For an arbitrary finite tree T$$ T $$, we find the exact value of the worst‐case stabilization time of majority dynamics on T$$ T $$. We also prove that for a perfect rooted cubic tree T$$ T $$ with diameter D$$ D $$ and uniformly random initial opinions, the dynamics stabilizes in time τ∈(D/4,D/3)$$ \tau \in \left(D/4,D/3\right) $$ with high ...
Itai Benjamini, Georgii Zakharov, Maksim Zhukovskii   +2 more
wiley   +1 more source