Results 61 to 70 of about 286,084 (291)
In the Maze of Data Languages [PDF]
In data languages the positions of strings and trees carry a label from a finite alphabet and a data value from an infinite alphabet. Extensions of automata and logics over finite alphabets have been defined to recognize data languages, both in the ...
D'Antoni, Loris
core
The Power of Non-Determinism in Higher-Order Implicit Complexity
We investigate the power of non-determinism in purely functional programming languages with higher-order types. Specifically, we consider cons-free programs of varying data orders, equipped with explicit non-deterministic choice.
A Goerdt +17 more
core +1 more source
Combining machine learning and probabilistic statistical learning is a powerful way to discover and design new materials. A variety of machine learning approaches can be used to identify promising candidates for target applications, and causal inference can help identify potential ways to make them a reality.
Jonathan Y. C. Ting, Amanda S. Barnard
wiley +1 more source
Can Nondeterminism Help Complementation?
Complementation and determinization are two fundamental notions in automata theory. The close relationship between the two has been well observed in the literature.
Aniello Murano +26 more
core +2 more sources
Behavior Trees in Robotics and AI: An Introduction
A Behavior Tree (BT) is a way to structure the switching between different tasks in an autonomous agent, such as a robot or a virtual entity in a computer game.
Colledanchise, Michele, Ögren, Petter
core +1 more source
Large Language Model in Materials Science: Roles, Challenges, and Strategic Outlook
Large language models (LLMs) are reshaping materials science. Acting as Oracle, Surrogate, Quant, and Arbiter, they now extract knowledge, predict properties, gauge risk, and steer decisions within a traceable loop. Overcoming data heterogeneity, hallucinations, and poor interpretability demands domain‐adapted models, cross‐modal data standards, and ...
Jinglan Zhang +4 more
wiley +1 more source
Subexponential convergence for information aggregation on regular trees
We consider the decentralized binary hypothesis testing problem on trees of bounded degree and increasing depth. For a regular tree of depth t and branching factor k>=2, we assume that the leaves have access to independent and identically distributed ...
Kanoria, Yashodhan, Montanari, Andrea
core +1 more source
The Challenge of Handling Structured Missingness in Integrated Data Sources
As data integration becomes ever more prevalent, a new research question that emerges is how to handle missing values that will inevitably arise in these large‐scale integrated databases? This missingness can be described as structured missingness, encompassing scenarios involving multivariate missingness mechanisms and deterministic, nonrandom ...
James Jackson +6 more
wiley +1 more source
An AI‐assisted approach is introduced to decode synthesis–performance relationships in metal‐organic framework‐derived supercapacitor materials using Bayesian optimization and predictive modeling, streamlining the search for optimal energy storage properties.
David Gryc +8 more
wiley +1 more source
This study reveals that sampling strategy (i.e., sampling size and approach) is a foundational prerequisite for building accurate and generalizable AI models in peptide discovery. Reaching a threshold of 7.5% of the total tetrapeptide sequence space was essential to ensure reliable predictions.
Meiru Yan +3 more
wiley +1 more source

