Concept

Problème de couverture par ensembles

Publications associées (88)

Optimal Task Assignment and Collision Avoidance for Mobile Robots

This report serves as a general overview of the semester project conducted in the SYCAMORE lab during the Spring 2022 semester. It focuses on multi- agent optimal task assignment methods, which have been implemented on state of the art simulation methods u ...

2022

Minimum Cost Intervention Design for Causal Effect Identification

Negar Kiyavash, Sina Akbari, Seyed Jalal Etesami

Pearl's do calculus is a complete axiomatic approach to learn the identifiable causal effects from observational data. When such an effect is not identifiable, it is necessary to perform a collection of often costly interventions in the system to learn the ...

PMLR2022

Knapsack and Subset Sum with Small Items

Adam Teodor Polak, Lars Rohwedder

Knapsack and Subset Sum are fundamental NP-hard problems in combinatorial optimization. Recently there has been a growing interest in understanding the best possible pseudopolynomial running times for these problems with respect to various parameters. In t ...

Schloss Dagstuhl -- Leibniz-Zentrum für Informatik2021

Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma

Friedrich Eisenbrand

We consider integer programming problems in standard form max{c(T)x : Ax = b, x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m), and c is an element of Z(n). We show that such an integer program can be solved in time ...

ASSOC COMPUTING MACHINERY2020

Enhanced Dissipation in the Navier-Stokes Equations Near the Poiseuille Flow

Klaus Martin Widmayer

We consider solutions to the 2d Navier-Stokes equations on T x R close to the Poiseuille flow, with small viscosity nu > 0. Our first result concerns a semigroup estimate for the linearized problem. Here we show that the x-dependent modes of linear solutio ...

SPRINGER2020

Reliable Frequency Regulation through Vehicle-to-Grid: From EU Legislation to Robust Optimization

Daniel Kuhn, François Richard Vuille, Dirk Lauinger

Vehicle-to-grid increases the low utilization rate of privately owned electric vehicles by making their batteries available to the electricity grid. We formulate a robust optimization problem in continuous time that maximizes the expected profit from selli ...

2020

Realizability of planar point embeddings from angle measurements

Majed El Helou, Adam James Scholefield, Frederike Dümbgen

Localization of a set of nodes is an important and a thoroughly researched problem in robotics and sensor networks. This paper is concerned with the theory of localization from inner-angle measurements. We focus on the challenging case where no anchor loca ...

2020

Linearly Convergent Frank-Wolfe with Backtracking Line-Search

Martin Jaggi

Structured constraints in Machine Learning have recently brought the Frank-Wolfe (FW) family of algorithms back into the spotlight. While the classical FW algorithm has poor local convergence properties, Away-steps FW and Pairwise FW have emerged as improv ...

ADDISON-WESLEY PUBL CO2020

No Small Linear Program Approximates Vertex Cover Within a Factor 2-epsilon

Ola Nils Anders Svensson, Abbas Bazzi

The vertex cover problem is one of the most important and intensively studied combinatorial optimization problems. Khot and Regev [Khot S, Regev O (2008) Vertex cover might be hard to approximate to within 2 - epsilon. J. Comput. System Sci. 74(3): 335-349 ...

INFORMS2019

Classification with Fairness Constraints: A Meta-Algorithm with Provable Guarantees

Nisheeth Vishnoi, Laura Elisa Celis, Vijay Keswani, Lingxiao Huang

Developing classification algorithms that are fair with respect to sensitive attributes of the data is an important problem due to the increased deployment of classification algorithms in societal contexts. Several recent works have focused on studying cla ...

ASSOC COMPUTING MACHINERY2019

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