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.
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 ...
When it comes to designing active control disposals, sound pressure sensing is usually required. In the framework of active control of acoustic impedance, this work aims at conceiving a digital estimator that processes voltage and current measurement to co ...
We present a new hybrid algorithm for local search in distributed combinatorial optimization. This method is a mix between classical local search methods in which nodes take decisions based only on local information, and full inference methods that guarant ...
Ieee Computer Soc Press, Customer Service Center, Po Box 3014, 10662 Los Vaqueros Circle, Los Alamitos, Ca 90720-1264 Usa2007
Within the field of multi-robot systems, multi-robot search is one area which is currently receiving a lot of research attention. One major challenge within this area is to design effective algorithms that allow a team of robots to work together to find th ...
This paper addresses the problem of choosing the best streaming policy for distortion optimal multipath video delivery, under delay constraints. The streaming policy consists in a joint selection of the video packets to be transmitted, as well as their sen ...
A goal of this paper is to efficiently adapt the best ingredients of the graph colouring techniques to an NP-hard satellite range scheduling problem, called MuRRSP. We propose two new heuristics for the MuRRSP, where as many jobs as possible have to be sch ...
In this paper we discuss the problem of alignment of patterns under arbitrary rotation. When a generic image pattern is geometrically transformed, it typically spans a (possibly nonlinear) manifold in a high dimensional space. When the pattern of interest ...
We define the distributed continuous-time combinatorial optimization problem. We propose a new notion of solution stability in aynamic optimization, based on the cost Of change from an already-implemented solution to the new one. Change costs are modeled w ...
Ieee Computer Soc Press, Customer Service Center, Po Box 3014, 10662 Los Vaqueros Circle, Los Alamitos, Ca 90720-1264 Usa2007
In this paper we consider the recovery of an airline schedule after an unforeseen event, commonly called disruption, that makes the planned schedule unfeasible. In particular we consider the aircraft recovery problem for a quasi-homogeneous fleet of aircra ...
System-level design decisions such as HW/SW partitioning, target architecture selection and scheduler selection are some of the main concerns of current complex system-on-chip (SOC) designs. In this paper, a novel window-based heuristic is proposed that ad ...