Publications associées à Fonction d'Ackermann

Geometric Algebra for Optimal Control With Applications in Manipulation Tasks

Many problems in robotics are fundamentally problems of geometry, which have led to an increased research effort in geometric methods for robotics in recent years. The results were algorithms using the various frameworks of screw theory, Lie algebra, and d ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2023

On Succinct Non-interactive Arguments in Relativized Worlds

Alessandro Chiesa

Succinct non-interactive arguments of knowledge (SNARKs) are cryptographic proofs with strong efficiency properties. Applications of SNARKs often involve proving computations that include the SNARK verifier, a technique called recursive composition. Unfort ...

SPRINGER INTERNATIONAL PUBLISHING AG2022

A Noise-Resistant Mixed-Discrete Particle Swarm Optimization Algorithm for the Automatic Design of Robotic Controllers

Alcherio Martinoli, Cyrill Silvan Baumann

The automatic design of well-performing robotic controllers is still an unsolved problem due to the inherently large parameter space and noisy, often hard-to-define performance metrics, especially when sequential tasks need to be accomplished. Distal contr ...

2022

Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity

Friedrich Eisenbrand, Moritz Andreas Venzin, Jana Tabea Cslovjecsek

We consider the problem of solving integer programs of the form min {c^⊺ x : Ax = b, x ∈ ℤ_{⩾ 0}}, where A is a multistage stochastic matrix in the following sense: the primal treedepth of A is bounded by a parameter d, which means that the columns of A ca ...

Schloss Dagstuhl - Leibniz-Zentrum für Informatik2021

A Hybrid Method for Spectral Translation Equivalent Boolean Functions

Giovanni De Micheli, Mathias Soeken, Eleonora Testa

The equivalence of Boolean functions with respect to five invariance (aka translation) operations has been well considered with respect to the Rademacher-Walsh spectral domain. In this paper, we introduce a hybrid approach that uses both the Reed-Muller an ...

IEEE2019

Classifying Functions with Exact Synthesis

Giovanni De Micheli, Mathias Soeken, Eleonora Testa, Winston Jason Haaswijk

Due to recent advances, constraint solvers have become efficient tools for synthesizing optimum Boolean circuits. We take advantage of this by showing how SAT based exact synthesis may be used as a method for finding minimum length Boolean chains. As oppos ...

IEEE2017

A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings

Andrew Joseph Reynolds

We prove that the quantifier-free fragment of the theory of character strings with regular language membership constraints and linear integer constraints over string lengths is decidable. We do that by describing a sound, complete and terminating tableaux ...

Springer-Verlag Berlin2015

Upper bounds for the reach-avoid probability via robust optimization

Maryam Kamgarpour, John Lygeros, Tyler Summers

We consider finite horizon reach-avoid problems for discrete time stochastic systems. Our goal is to construct upper bound functions for the reach-avoid probability by means of tractable convex optimization problems. We achieve this by restricting attentio ...

2015

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.

Fonction d'Ackermann

Geometric Algebra for Optimal Control With Applications in Manipulation Tasks

On Succinct Non-interactive Arguments in Relativized Worlds

A Noise-Resistant Mixed-Discrete Particle Swarm Optimization Algorithm for the Automatic Design of Robotic Controllers

Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity

A Hybrid Method for Spectral Translation Equivalent Boolean Functions

Classifying Functions with Exact Synthesis

A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings

Developing Verified Software Using Leon

Function Computation over Networks

Upper bounds for the reach-avoid probability via robust optimization

Graph Chatbot

Chattez avec Graph Search

Geometric Algebra for Optimal Control With Applications in Manipulation Tasks

Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity

Upper bounds for the reach-avoid probability via robust optimization

A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings

Function Computation over Networks

A Noise-Resistant Mixed-Discrete Particle Swarm Optimization Algorithm for the Automatic Design of Robotic Controllers

On Succinct Non-interactive Arguments in Relativized Worlds

A Hybrid Method for Spectral Translation Equivalent Boolean Functions

Developing Verified Software Using Leon

Classifying Functions with Exact Synthesis