Concept

Problèmes du prix du millénaire

Publications associées (103)

MPTCP is not Pareto-Optimal: Performance Issues and a Possible Solution

Jean-Yves Le Boudec, Nicolas Gabriel Gast, Ramin Khalili, Utkarsh Upadhyay, Miroslav Popovic

MPTCP has been proposed recently as a mechanism for sup- porting transparently multiple connections to the applica- tion layer. It is under discussion at the IETF. We show, however, that the current MPTCP suffers from two prob- lems: (P1) Upgrading some TC ...

2012

Reduction strategies for shape dependent inverse problems in haemodynamics

Gianluigi Rozza, Andrea Manzoni, Toni Mikael Lassila

This work deals with the development and application of reduction strategies for real-time and many query problems arising in fluid dynamics, such as shape optimization, shape registration (reconstruction), and shape parametrization. The proposed strategy ...

Springer2012

Reduced basis finite element heterogeneous multiscale method for high-order discretizations of elliptic homogenization problems

Assyr Abdulle, Yun Bai

A new finite element method for the efficient discretization of elliptic homogenization problems is proposed. These problems, characterized by data varying over a wide range of scales cannot be easily solved by classical numerical methods that need mesh re ...

Elsevier2012

Optical Methods for Solid Mechanics: A Full-Field Approach

Unique within the field for being written in a tutorial style, this textbook adopts a step-by-step approach to the background needed for understanding a wide range of full-field optical measurement techniques in solid mechanics. This method familiarizes re ...

WILEY-VCH2012

Tight Approximation Algorithms for Scheduling with Fixed Jobs and Nonavailability

Ola Nils Anders Svensson, Klaus Jansen

We study two closely related problems in nonpreemptive scheduling of jobs on identical parallel machines. In these two settings there are either fixed jobs or nonavailability intervals during which the machines are not available; in both cases, the objecti ...

Assoc Computing Machinery2012

The Weakest Failure Detectors To Solve Quittable Consensus And Nonblocking Atomic Commit

Rachid Guerraoui

We define quittable consensus, a natural variation of the consensus problem, where processes have the option to agree on "quit" if failures occur, and we relate this problem to the well-known problem of nonblocking atomic commit. We then determine the weak ...

Society for Industrial and Applied Mathematics2012

Introduction to Reliable and Secure Distributed Programming

Rachid Guerraoui, Christian Cachin

This book provides an introduction to distributed programming abstractions and presents the fundamental algorithms that implement them in several distributed en- vironments. The reader is given insight into the important problems of distributed computing a ...

Springer2011

An ALE-based numerical technique for modeling sedimentary basin evolution featuring layer deformations and faults

Alfio Quarteroni, Adelmo Cristiano Innocenza Malossi, Andrea Villa

In this paper we present a numerical tool to simulate dynamics of stratified sedimentary basins, i.e. depressions on the Earth’s surface filled by sediments. The basins are usually complicated by crustal deformations and faulting of the sediments. The bala ...

Elsevier2011

Discrete time stochastic hybrid dynamical games: Verification & controller synthesis

Maryam Kamgarpour

This paper presents a framework for analyzing probabilistic safety and reachability problems for discrete time stochastic hybrid systems in scenarios where system dynamics are affected by rational competing agents. In particular, we consider a zero-sum gam ...

2011

Uncertainty Feature Optimization: an implicit paradigm for problems with noisy data

Michel Bierlaire, Matteo Salani, Niklaus Eggenberg

Optimization problems with noisy data solved using stochastic programming or robust optimization approaches require the explicit characterization of an uncertainty set U that models the nature of the noise. Such approaches depend on the modeling of the unc ...

2011

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