Publication

K-Adaptability in Two-Stage Robust Binary Programming

Publications associées (81)

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

Graph fragmentation problem: analysis and synthesis

Manuel Francesco Aprile

Vulnerability metrics play a key role in the understanding of cascading failures and target/random attacks to a network. The graph fragmentation problem (GFP) is the result of a worst-case analysis of a random attack. We can choose a fixed number of indivi ...

WILEY2019

Sampling can be faster than optimization

Nicolas Henri Bernard Flammarion

Optimization algorithms and Monte Carlo sampling algorithms have provided the computational foundations for the rapid growth in applications of statistical machine learning in recent years. There is, however, limited theoretical understanding of the relati ...

PNAS2019

Stable Fractional Matchings

Aris Filos Ratsikas

We study a generalization of the classical stable matching problem that allows for cardinal preferences (as opposed to ordinal) and fractional matchings (as opposed to integral). After observing that, in this cardinal setting, stable fractional matchings c ...

2019

Stable Fractional Matchings

Aris Filos Ratsikas

ASSOC COMPUTING MACHINERY2019

Distributed Routing and Charging Scheduling Optimization for Internet of Electric Vehicles

Xiaoying Tang

In this paper, we consider an Internet of Electric Vehicles (IoEV) powered by heterogeneous charging facilities in the transportation network. In particular, we take into account the state-of-the-art vehicle-to-grid (V2G) charging and renewable power gener ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2019

Taylor-Fourier PMU on a Real-Time Simulator: Design, Implementation and Characterization

Guglielmo Frigo

The development of software models of Phasor Measurement Units (PMUs) within Real-Time Simulators (RTSs) represents a promising tool for the design and validation of monitoring and control applications in electrical power networks. In this sense, it is nec ...

2019

Taylor-Fourier PMU on a Real-Time Simulator: Design, Implementation and Characterization

Mario Paolone, Asja Derviskadic, Guglielmo Frigo, Yihui Zuo, Alexandre Bach

IEEE2019

Super Resolution Phase Retrieval for Sparse Signals

Martin Vetterli, Juri Ranieri, Gilles Baechler, Amina Chebira, Miranda Krekovic

In a variety of fields, in particular those involving imaging and optics, we often measure signals whose phase is missing or has been irremediably distorted. Phase retrieval attempts to recover the phase information of a signal from the magnitude of its Fo ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2018

The complexity of error metrics

Mathias Soeken

Approximate computing exploits the fact that many applications do not require the results to be exact but not to exceed a threshold in a given error metric. Algorithms in approximate computing require to compute the error of the approximation in order to m ...

ELSEVIER SCIENCE BV2018

The Linear Programming Approach to Reach-Avoid Problems for Markov Decision Processes

Maryam Kamgarpour, John Lygeros, Tyler Summers

One of the most fundamental problems in Markov decision processes is analysis and control synthesis for safety and reachability specifications. We consider the stochastic reach-avoid problem, in which the objective is to synthesize a control policy to max ...

2017