Publications associées à Minimisation d'un automate fini déterministe

Phenomenological theory of variational quantum ground-state preparation

The variational approach is a cornerstone of computational physics, considering both conventional and quantum computing computational platforms. The variational quantum eigensolver algorithm aims to prepare the ground state of a Hamiltonian exploiting para ...

College Pk2023

Lower Bounds for Unambiguous Automata via Communication Complexity

Mika Tapani Göös, Weiqiang Yuan

We use results from communication complexity, both new and old ones, to prove lower bounds for unambiguous finite automata (UFAs). We show three results. 1) Complement: There is a language L recognised by an n-state UFA such that the complement language ...

Schloss Dagstuhl - Leibniz-Zentrum für Informatik2022

KPC: Learning-Based Model Predictive Control with Deterministic Guarantees

Colin Neil Jones, Yuning Jiang, Paul Scharnhorst, Emilio Maddalena

We propose Kernel Predictive Control (KPC), a learning-based predictive control strategy that enjoys deterministic guarantees of safety. Noise-corrupted samples of the unknown system dynamics are used to learn several models through the formalism of non-pa ...

2021

On compact representations of Voronoi cells of lattices

Matthias Schymura, Christoph Hunkenschröder

In a seminal work, Micciancio and Voulgaris (SIAM J Comput 42(3):1364-1391, 2013) described a deterministic single-exponential time algorithm for the closest vector problem (CVP) on lattices. It is based on the computation of the Voronoi cell of the given ...

SPRINGER HEIDELBERG2020

Perfect soliton crystals in optical microresonators

Tobias Kippenberg, Junqiu Liu, Maxim Karpov, Hairun Guo, Martin Hubert Peter Pfeiffer, Wenle Weng

We demonstrate the existence of perfect soliton crystal states and develop the deterministic procedure for their excitation in Si3N4 microresonators. We show that despite exceptional symmetrical properties, their behavior is strongly linked to the chaotic ...

IEEE2019

On compact representations of Voronoi cells of lattices

Matthias Schymura, Christoph Hunkenschröder

In a seminal work, Micciancio & Voulgaris (2010) described a deterministic single-exponential time algorithm for the Closest Vector Problem (CVP) on lattices. It is based on the computation of the Voronoi cell of the given lattice and thus may need exponen ...

SPRINGER INTERNATIONAL PUBLISHING AG2018

Pro Free Will Priming Enhances "Risk-Taking" Behavior in the Iowa Gambling Task, but Not in the Balloon Analogue Risk Task: Two Independent Priming Studies

Christine Mohr, Noé Thomas Elie Ohana, Alessandro Tremea

Studies indicated that people behave less responsibly after exposure to information containing deterministic statements as compared to free will statements or neutral statements. Thus, deterministic primes should lead to enhanced risk-taking behavior. We t ...

Public Library Science2016

Probabilistic speed-density relationship for pedestrian traffic

Michel Bierlaire, Matthieu Marie Cochon de Lapparent, Bilal Farooq, Marija Nikolic

We propose a probabilistic modeling approach to represent the speed-density relationship of pedestrian traffic. The approach is data-driven, and it is motivated by the presence of high scatter in the raw data that we have analyzed. We show the validity of ...

Pergamon-Elsevier Science Ltd2016

Who's On Board? Probabilistic Membership for Real-Time Distributed Control Systems (Extended)

Rachid Guerraoui, David Kozhaya, Yvonne Anne Pignolet-Oswald

To increase their dependability, distributed control systems (DCSs) need to agree in real time about which hosts have crashed, i.e., they need a real-time membership service. In this paper, we prove that such a service cannot be implemented deterministical ...

SRDS2016

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.

Minimisation d'un automate fini déterministe

Phenomenological theory of variational quantum ground-state preparation

Lower Bounds for Unambiguous Automata via Communication Complexity

KPC: Learning-Based Model Predictive Control with Deterministic Guarantees

On compact representations of Voronoi cells of lattices

Risk assessment of pedestrian crossings: a stochastic video-based analysis

Perfect soliton crystals in optical microresonators

On compact representations of Voronoi cells of lattices

Pro Free Will Priming Enhances "Risk-Taking" Behavior in the Iowa Gambling Task, but Not in the Balloon Analogue Risk Task: Two Independent Priming Studies

Probabilistic speed-density relationship for pedestrian traffic

Who's On Board? Probabilistic Membership for Real-Time Distributed Control Systems (Extended)

Graph Chatbot

Chattez avec Graph Search

Lower Bounds for Unambiguous Automata via Communication Complexity

Phenomenological theory of variational quantum ground-state preparation

KPC: Learning-Based Model Predictive Control with Deterministic Guarantees

On compact representations of Voronoi cells of lattices

Risk assessment of pedestrian crossings: a stochastic video-based analysis

Perfect soliton crystals in optical microresonators

On compact representations of Voronoi cells of lattices

Pro Free Will Priming Enhances "Risk-Taking" Behavior in the Iowa Gambling Task, but Not in the Balloon Analogue Risk Task: Two Independent Priming Studies

Probabilistic speed-density relationship for pedestrian traffic

Who's On Board? Probabilistic Membership for Real-Time Distributed Control Systems (Extended)