Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
In this paper, we propose a representation selection optimization problem for complexity constrained adaptive video streaming that properly takes into account the different complexity-rate-distortion (C-R-D) characteristics of the videos when implementing ...
The aim of this paper is to analyze and to improve the current planning process of the passenger railway service in light of the recent railway market changes. In order to do so, we introduce the Passenger Centric Train Timetabling Problem. The originality ...
The restricted max-min fair allocation problem (also known as the restricted Santa Claus problem) is one of few problems that enjoys the intriguing status of having a better estimation algorithm than approximation algorithm. Indeed, Asadpour et al. [2012] ...
This paper provides expressions for the largest and smallest solution of a global optimization problem using an adjoint variable which represents the available one-sided improvements up to the interval “horizon”. Interpreting the problem in terms of optima ...
The unique shortest vector problem on a rational lattice is the problem of finding the shortest non-zero vector under the promise that it is unique (up to multiplication by -1). We give several incremental improvements on the known hardness of the unique s ...
Solving a multi-input dynamic optimization of a batch processes is a complex problem involving interactions between input variables and constraints over time. The problem gets more difficult due to the presence of local solutions that have almost the same ...
Cloaking using complementary media was suggested by Lai et al. in [8]. The study of this problem faces two difficulties. Firstly, this problem is unstable since the equations describing the phenomenon have sign changing coefficients, hence the ellipticity ...
We give a constant factor approximation algorithm for the Asymmetric Traveling Salesman Problem on shortest path metrics of directed graphs with two different edge weights. For the case of unit edge weights, the first constant factor approximation was give ...
The estimation of the lightning performance of a power distribution network is of great importance to design its protection system against lightning. An accurate evaluation of the number of lightning events that can create dangerous overvoltages requires a ...
We study the existence and uniqueness of Nash equilibria for a certain class of aggregative games with finite and possibly large number of players. Sufficient conditions for these are obtained using the theory of variational inequalities together with the ...