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 letter, we consider peer-to-peer (P2P) networks, where multiple peers are interested in sharing their content. In the considered P2P system, autonomous and self-interested peers use a Markov Decision Process (MDP) framework to determine their uploa ...
We study bounding approximations for a multistage stochastic program with expected value constraints. Two simpler approximate stochastic programs, which provide upper and lower bounds on the original problem, are obtained by replacing the original stochast ...
The A* algorithm is a well-known heuristic best-first search method. Several performance-accelerated extensions of the exact A* approach are known. Interesting examples are approximate algorithms where the heuristic function used is inflated by a weight (o ...
Reputation-based trust models using statistical learning have been intensively studied for distributed systems where peers behave maliciously. However practical applications of such models in environments with both malicious and rational behaviors are stil ...
Multistage stochastic programs have applications in many areas and support policy makers in finding rational decisions that hedge against unforeseen negative events. In order to ensure computational tractability, continuous-state stochastic programs are us ...
Reputation-based trust models based on statistical learning have been intensively studied for large-scale distributed systems whereas practical application of game-theoretic approaches using sanctioning are still very little understood in such settings. Th ...
This paper studies the problem of demand driven employee scheduling for direct-sales retail outlets. The demand for sales personnel during each half hour is predicted a week in advance based on previous recorded data and the problem of computing an optimal ...
Infrastructure managers of medium size bridge stocks are being faced with the task of approximating short, mid to long term financial needs for their infrastructure. This task is particularly demanding due to the lack of relevant information, in particular ...
The proposed heuristic combines a variable neighborhood search (VNS) framework with a local search performed by a trust-region algorithm. The curvature of the function is exploited to generate the neighborhoods. Numerical results illustrate an excellent be ...
Agreement is at the heart of distributed computing. In its simple form, it requires a set of processes to decide on a common value out of the values they propose. The time-complexity of distributed agreement problems is generally measured in terms of the n ...
