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.
Tuning tools attempt to configure a database to achieve optimal performance for a given workload. Selecting an optimal set of physical structures is computationally hard since it involves searching a vast space of possible configurations. Commercial DBMSs ...
The Steiner tree problem is one of the most fundamental NP-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum-cost tree spanning the terminals. In a sequence of papers, the approximation ratio for this problem w ...
This thesis addresses three challenges in algorithmic mechanism design, which seeks to devise computationally efficient mechanisms consisting of an outcome rule and a payment rule that implement desirable outcomes in strategic equilibrium. The first challe ...
We define the distributed, real-time combinatorial optimization problem. We propose a general, semantically well-defined notion of solution stability in such systems, based on the cost of change from an already implemented solution to the new one. This app ...
Collaborative ad-hoc dissemination of information has been proposed as an efficient means to disseminate information among devices in a wireless ad-hoc network. Devices help in forwarding the information channels to the entire network, by disseminating the ...
The Vehicle Routing Problem (VRP) has been extensively studied over the last twenty years, because it is an abstraction of many real-life logistics problems. In its multiple-depot variant (MDVRP), the routes of vehicles located at various depots must be op ...
This paper addresses the problem of efficiently delivering a layered media stream from multiple senders to a single receiver, over channels that present correlated packet loss patterns. Using a digital fountain approach, the performance of a distributed st ...
The purpose of this paper is to develop methods that can reconstruct a bandlimited discrete-time signal from an irreg- ular set of samples at unknown locations. We define a solution to the problem using first a geometric and then an algebraic point of view ...
A novel omnidirectional visual sensor called the Panoptic camera is introduced. The Panoptic camera is an omnidirectional multi-aperture visual system which is realized by mounting multiple camera sensors on a hemispherical frame. The introduced visual sen ...
In many real-life optimization problems involving multiple agents, the rewards are not necessarily known exactly in advance, but rather depend on sources of exogenous uncertainty. For instance, delivery companies might have to coordinate to choose who shou ...