Publications related to K-Adaptability in Two-Stage Distributionally Robust Binary Programming

Stable Fractional Matchings

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

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 ...

ASSOC COMPUTING MACHINERY2019

Asymptotically Optimal Contextual Bandit Algorithm Using Hierarchical Structures

Hakan Gökcesu, Kaan Gökcesu

We propose an online algorithm for sequential learning in the contextual multiarmed bandit setting. Our approach is to partition the context space and, then, optimally combine all of the possible mappings between the partition regions and the set of bandit ...

2019

Fast assembly of Galerkin matrices for 3D solid laminated composites using finite element and isogeometric discretizations

Pablo Antolin Sanchez

This work presents a novel methodology for speeding up the assembly of stiffness matrices for laminate composite 3D structures in the context of isogeometric and finite element discretizations. By splitting the involved terms into their in-plane and out-of ...

2019

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

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 ...

IEEE2019

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

Extreme Image Completion

Sabine Süsstrunk, Radhakrishna Achanta, Nikolaos Arvanitopoulos Darginis

It is challenging to complete an image whose 99 percent pixels are randomly missing. We present a solution to this extreme image completion problem. As opposed to existing techniques, our solution has a computational complexity that is linear in the number ...

Ieee2017

A Comment on “Computational Complexity of Stochastic Programming Problems”

Daniel Kuhn, Grani Adiwena Hanasusanto, Wolfram Wiesemann

Although stochastic programming problems were always believed to be computationally challenging, this perception has only recently received a theoretical justification by the seminal work of Dyer and Stougie (Mathematical Programming A, 106(3):423–432, 200 ...

Springer Heidelberg2016

Exact Algorithms for $ L ^{ 1 } $ -TV Regularization of Real-Valued or Circle-Valued Signals

Michaël Unser, Martin Kurt Storath

We consider

L ^{ 1 }

-TV regularization of univariate signals with values on the real line or on the unit circle. While the real data space leads to a convex optimization problem, the problem is nonconvex for circle-valued data. In this paper, we deriv ...

SIAM2016

K-Adaptability in Two-Stage Distributionally Robust Binary Programming

Graph Chatbot

Chat with Graph Search

Stable Fractional Matchings

Stable Fractional Matchings

Asymptotically Optimal Contextual Bandit Algorithm Using Hierarchical Structures

Fast assembly of Galerkin matrices for 3D solid laminated composites using finite element and isogeometric discretizations

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

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

The complexity of error metrics

Extreme Image Completion

A Comment on “Computational Complexity of Stochastic Programming Problems”

Exact Algorithms for $ L ^{ 1 } $ -TV Regularization of Real-Valued or Circle-Valued Signals

Fast assembly of Galerkin matrices for 3D solid laminated composites using finite element and isogeometric discretizations

Extreme Image Completion

A Comment on “Computational Complexity of Stochastic Programming Problems”

Stable Fractional Matchings

Stable Fractional Matchings

Asymptotically Optimal Contextual Bandit Algorithm Using Hierarchical Structures

Exact Algorithms for $ L ^{ 1 } $ -TV Regularization of Real-Valued or Circle-Valued Signals

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

The complexity of error metrics

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