Publication

Safe Schedule Verification for Urban Air Mobility Networks With Node Closures

Publications associées (33)

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

Design of plug-and-play model predictive control: an approach based on linear programming

Giancarlo Ferrari Trecate, Marcello Farina

In this paper we consider a linear system represented by subsystems coupled through states and propose a distributed control scheme for guaranteeing asymptotic stability and satisfaction of constraints on system inputs and states. Our design procedure enab ...

2013

Method for Combined Water-Energy Recovery in Industrial Processes

Maziar Kermani

This diploma project is a joint effort between Industrial Energy System Laboratory (LENI) of EPFL and CanmetENERGY-Varennes of Natural Resources Canada on the application of advanced process integration methods for the optimal water and energy integration ...

2013

New Results in the Theory of Linear and Integer Programming

Nicolai Hähnle

The polynomial Hirsch conjecture states that the vertex-edge diameter of a d-dimensional polyhedron with n facets is bounded by a polynomial in d and n. For the special case where the polyhedron is defined as the set of points satisfying a system Ax ≤ b of ...

EPFL2012

Vectors in a box

Doemoetoer Palvoelgyi

For an integer d a parts per thousand yen 1, let tau(d) be the smallest integer with the following property: if v (1), v (2), . . . , v (t) is a sequence of t a parts per thousand yen 2 vectors in [-1, 1] (d) with , then there is a set of indices, 2 a part ...

Springer2012

Dynamically Selecting Composition Algorithms for Economical Composition as a Service

Boi Faltings, Immanuel Trummer

Various algorithms have been proposed for the problem of quality-driven service composition. They differ by the quality of the resulting executable processes and by their processing costs. In this paper, we study the problem of service composition from an ...

Springer-Verlag Berlin2011

New Algorithms for Approximate Nash Equilibria in Bimatrix Games

We consider the problem of computing additively approximate Nash equilibria in noncooperative two-player games. We provide a new polynomial time algorithm that achieves an approximation guarantee of 0.36392. We first provide a simpler algorithm, that achie ...

2010

Multiple Object Tracking using Flow Linear Programming

Pascal Fua, François Fleuret, Jérôme Berclaz

Multi-object tracking can be achieved by detecting objects in individual frames and then linking detections across frames. Such an approach can be made very robust to the occasional detection failure: If an object is not detected in a frame but is in previ ...

2009

Multiple Object Tracking using Flow Linear Programming

Pascal Fua, François Fleuret, Jérôme Berclaz

Multi-object tracking can be achieved by detecting objects in individ- ual frames and then linking detections across frames. Such an approach can be made very robust to the occasional detection failure: If an object is not detected in a frame but is in pre ...

Idiap2009

A Unified Framework for Max-Min and Min-Max Fairness with Applications

Jean-Yves Le Boudec

Max-min fairness is widely used in various areas of networking. In every case where it is used, there is a proof of existence and one or several algorithms for computing it; in most, but not all cases, they are based on the notion of bottlenecks. In spite ...

2007

A Unified Framework for Max-Min and Min-Max Fairness with Applications

Jean-Yves Le Boudec

Max-min fairness is widely used in various areas of networking. In every case where it is used, there is a proof of existence and one or several algorithms for computing the max-min fair allocation; in most, but not all cases, they are based on the notion ...

2006