Concept

Problèmes de Hilbert

Publications associées (99)

An Adjoint Approach for Stabilizing the Parareal Method

Jan Sickmann Hesthaven, Allan Svejstrup Nielsen, Yvon Maday

The parareal algorithm seeks to extract parallelism in the time-integration direction of time-dependent differential equations. While it has been applied with success to a wide range of problems, it suffers from some stability issues when applied to non-di ...

2015

A Decision Procedure for (Co)datatypes in SMT Solvers

Andrew Joseph Reynolds

We present a decision procedure that combines reasoning about datatypes and codatatypes. The dual of the acyclicity rule for datatypes is a uniqueness rule that identifies observationally equal codatatype values, including cyclic values. The procedure deci ...

Springer-Verlag Berlin2015

Diffusion LMS Over Multitask Networks

Ali H. Sayed, Jie Chen

The diffusion LMS algorithm has been extensively studied in recent years. This efficient strategy allows to address distributed optimization problems over networks in the case where nodes have to collaboratively estimate a single parameter vector. Neverthe ...

Institute of Electrical and Electronics Engineers2015

Optimal expulsion and optimal confinement of a Brownian particle with a switching cost

Robert Dalang, Laura Vinckenbosch

We solve two stochastic control problems in which a player tries to minimize or maximize the exit time from an interval of a Brownian particle, by controlling its drift. The player can change from one drift to another but is subject to a switching cost. In ...

Elsevier Science Bv2014

Efficient geometrical parametrisation techniques of interfaces for reduced-order modelling: application to fluid-structure interaction coupling problems

Gianluigi Rozza, Davide Forti

We present some recent advances and improvements in shape parametrisation techniques of interfaces for reduced-order modelling with special attention to fluid-structure interaction problems and the management of structural deformations, namely, to represen ...

Taylor & Francis2014

Existence Of Solutions For Jacobian And Hessian Equations Under Smallness Assumptions

Bernard Dacorogna, Sébastien Basterrechea

We discuss three types of problems. The first one involves Jacobian equations and the two others involve Hessian equations. We proceed by fixed point, obtaining the results under a smallness assumption. ...

Taylor & Francis Inc2014

Supply chain crime - taxonomy development and empirical validation

Supply chain security (SCS) management has been widely discussed among policy makers, supply chain practitioners and scientists since the terrorist attacks of September 11, 2001. However, the extant academic literature offers only a cursory look on crime p ...

Inderscience Enterprises Ltd2014

Consistent Packet Processing - Because Consistent Updates Are Not Enough

Dejan Kostic, Marco Canini, Peter Peresini, Maciej Leszek Kuzniar, Nedeljko Vasic

In this poster and demo, we showcase a new class of problems that can occur due to inconsistent packet processing at an OpenFlow controller. We proceed to outline a potential solution. ...

2013

Extended Reverse Convex Programming: An Active-Set Approach to Global Optimization

Gene Bunin

Reverse convex programming (RCP) represents an important class of global optimization problems consisting of concave cost and inequality constraint functions. While useful in many practical scenarios due to the frequent appearance of concave models, a more ...

Springer Verlag2013

New Bounds for Random Constraint Satisfaction Problems via Spatial Coupling

Rüdiger Urbanke, Nicolas Macris, Seyed Hamed Hassani

This paper is about a novel technique called spatial coupling and its application in the analysis of random constraint satisfaction problems (CSP). Spatial Coupling was recently invented in the area of error correcting codes where it has resulted in effici ...

2013

Graph Chatbot

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.

Connectez-vous pour utiliser Chat avec Graph Search