Results 101 to 110 of about 59,541 (246)
Sequence domains and integer-valued polynomials
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
ABSTRACT Data‐based learning of system dynamics allows model‐based control approaches to be applied to systems with partially unknown dynamics. Gaussian process regression is a preferred approach that outputs not only the learned system model but also the variance of the model, which can be seen as a measure of uncertainty.
Daniel Landgraf +2 more
wiley +1 more source
The role of identification in data‐driven policy iteration: A system theoretic study
Abstract The goal of this article is to study fundamental mechanisms behind so‐called indirect and direct data‐driven control for unknown systems. Specifically, we consider policy iteration applied to the linear quadratic regulator problem. Two iterative procedures, where data collected from the system are repeatedly used to compute new estimates of ...
Bowen Song, Andrea Iannelli
wiley +1 more source
Let $f(X)$ be a polynomial with rational coefficients, $S$ be an infinite subset of the rational numbers and consider the image set $f(S)$. If $g(X)$ is a polynomial such that $f(S)=g(S)$ we say that $g$ \emph{parametrizes} the set $f(S)$. Besides the obvious solution $g=f$ we may want to impose some conditions on the polynomial $g$; for example, if $f(
openaire +1 more source
Path‐Based Deep Reinforcement Learning for On‐Board Routing in Satellite Constellation Networks
ABSTRACT Efficient usage of available network resources is a crucial factor for broadband services in interconnected satellite constellations. To meet required quality of service standards under heavy network loads, it is essential to optimize traffic distribution among the intersatellite links. To address this challenge, we propose an adaptive traffic
Manuel M. H. Roth +4 more
wiley +1 more source
Integer-valued polynomials satisfying growth constraints
We consider polynomials which take integer values on the integers (IVPs), and satisfy an additional growth condition on the natural numbers. Elkies and Speyer, answering a question by Dimitrov, showed there is a critical exponential growth threshold, such that there are infinitely many IVPs with growth above the threshold and finitely many IVPs below ...
Kiro, Avner, Nishry, Alon
openaire +2 more sources
Finding Minimum‐Cost Explanations for Predictions Made by Tree Ensembles
ABSTRACT The ability to reliably explain why a machine learning model arrives at a particular prediction is crucial when used as decision support by human operators of critical systems. The provided explanations must be provably correct, and preferably without redundant information, called minimal explanations.
John Törnblom +2 more
wiley +1 more source
A Resource Efficient Ising Model‐Based Quantum Sudoku Solver
ABSTRACT Background Quantum algorithms exploit superposition and parallelism to address complex combinatorial problems, many of which fall into the non‐polynomial (NP) class. Sudoku, a widely known logic‐based puzzle, is proven to be NP‐complete and thus presents a suitable testbed for exploring quantum optimization approaches.
Wen‐Li Wang +5 more
wiley +1 more source
Generating Ideals in Rings of Integer-Valued Polynomials
AbstractLetRbe a one-dimensional locally analytically irreducible Noetherian domain with finite residue fields. In this note it is shown that if I is a finitely generated ideal of the ring Int(R) of integer-valued polynomials such that for eachx∈ R the idealis stronglyn-generated,n≥ 2, thenIisn-generated, and some variations of this result.
openaire +1 more source
ABSTRACT Networked control systems (NCSs) often suffer from performance degradation due to limited communication bandwidth, which can cause data transmission conflicts and packet loss. Existing scheduling strategies may fail to simultaneously meet the real‐time requirements and the importance of multisensor data, and they are particularly vulnerable ...
Da Chen +5 more
wiley +1 more source

