Publications associées à Measuring and Synthesizing Systems in Probabilistic Environments

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics

Florian Karl Richter

A set

R\subset \mathbb{N}

is called rational if it is well approximable by finite unions of arithmetic progressions, meaning that for every

\unicode[STIX]{x1D716}>0

there exists a set

B=\bigcup _{i=1}^{r}a_{i}\mathbb{N}+b_{i}

, where $a_{1},\ldots ,a_ ...

2019

Measuring and Synthesizing Systems in Probabilistic Environments

Graph Chatbot

Chattez avec Graph Search

Hidden Markov Modeling Over Graphs

Lower Bounds for Unambiguous Automata via Communication Complexity

TFHE: Fast Fully Homomorphic Encryption Over the Torus

The time-dependent expected reward and deviation matrix of a finite QBD process

New Graph Algorithms via Polyhedral Techniques

Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics

Proactive Synthesis of Recursive Tree-to-String Functions from Examples

Solving the Infinite-horizon Constrained LQR Problem using Accelerated Dual Proximal Methods

Control of Interbank Contagion Under Partial Information

Multivariate Markov-type and Nikolskii-type inequalities for polynomials associated with downward closed multi-index sets

Hidden Markov Modeling Over Graphs

Lower Bounds for Unambiguous Automata via Communication Complexity

TFHE: Fast Fully Homomorphic Encryption Over the Torus

New Graph Algorithms via Polyhedral Techniques

Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics

Solving the Infinite-horizon Constrained LQR Problem using Accelerated Dual Proximal Methods

Proactive Synthesis of Recursive Tree-to-String Functions from Examples

Control of Interbank Contagion Under Partial Information

Multivariate Markov-type and Nikolskii-type inequalities for polynomials associated with downward closed multi-index sets

The time-dependent expected reward and deviation matrix of a finite QBD process