Publications associées à NEAR-LINEAR TIME ALGORITHM FOR n-FOLD ILPs VIA COLOR CODING

Publications associées (14)

Integer points in the degree-sequence polytope

An integer vector 𝑏 ∈ Z𝑑 is a degree sequence if there exists a hypergraph with vertices {1, … , 𝑑} such that each 𝑏𝑖 is the number of hyperedges containing 𝑖. The degree-sequence polytope 𝒵 𝑑 is the convex hull of all degree sequences. We show that all bu ...

ELSEVIER2025

Hybrid Decentralized Optimization: Leveraging Both First- and Zeroth-Order Optimizers for Faster Convergence

Matin Ansaripour

Distributed optimization is the standard way of speeding up machine learning training, and most of the research in the area focuses on distributed first-order, gradient-based methods. Yet, there are settings where some computationally-bounded nodes may not ...

Association for the Advancement of Artificial Intelligence2025

From Local Energy Communities towards National Energy System: A Grid-Aware Techno-Economic Analysis

Joseph René Hubert Loustau, François Maréchal, Cédric Terrier, Dorsan Alexis A. Lepour

Energy communities are key actors in the energy transition since they optimally interconnect renewable energy capacities with the consumers. Despite versatile objectives, they usually aim at improving the self-consumption of renewable electricity within lo ...

MDPI2024

On inequalities with bounded coefficients and pitch for the min knapsack polytope

Ola Nils Anders Svensson, Igor Malinovic

The min knapsack problem appears as a major component in the structure of capacitated covering problems. Its polyhedral relaxations have been extensively studied, leading to strong relaxations for networking, scheduling and facility location problems. ...

ELSEVIER2022

Cooperative energy management of a community of smart-buildings: A Blockchain approach

Maher Kayal, Olivier Valentin Henri Van Cutsem

Demand Response (DR) is progressively moving from a centralized, unidirectional structure to a set of advanced decentralized mechanisms that better balance distributed supply and demand. This paper presents a decentralized cooperative DR framework to manag ...

ELSEVIER SCI LTD2020

A Resource-Aware Approach to Self-Triggered Model Predictive Control

Colin Neil Jones

In this paper, we consider a self-triggered formulation of model predictive control. In this variant, the controller decides at the current sampling instant itself when the next sample should be taken and the optimization problem be solved anew. We incorpo ...

ELSEVIER2020

Learning Over Multitask Graphs-Part I: Stability Analysis

Ali H. Sayed, Stefan Vlaski, Roula Nassif

This paper formulates a multitask optimization problem where agents in the network have individual objectives to meet, or individual parameter vectors to estimate, subject to a smoothness condition over the graph. The smoothness condition softens the trans ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Pyroomacoustics: A Python Package For Audio Room Simulation And Array Processing Algorithms

Ivan Dokmanic, Robin Scheibler, Eric Bezzam

We present pyroomacoustics, a software package aimed at the rapid development and testing of audio array processing algorithms. The content of the package can be divided into three main components: an intuitive Python object-oriented interface to quickly c ...

IEEE2018

Maximizing Symmetric Submodular Functions

Moran Feldman

Symmetric submodular functions are an important family of submodular functions capturing many interesting cases, including cut functions of graphs and hypergraphs. Maximization of such functions subject to various constraints receives little attention by c ...

Association for Computing Machinery2017

Removing and Adding Edges for the Traveling Salesman Problem

Ola Nils Anders Svensson

We present a framework for approximating the metric TSP based on a novel use of matchings. Traditionally, matchings have been used to add edges to make a given graph Eulerian, whereas our approach also allows for the removal of certain edges leading to a d ...

Assoc Computing Machinery2016

A Fast Hadamard Transform for Signals with Sub-linear Sparsity in the Transform Domain

Martin Vetterli, Robin Scheibler, Saeid Haghighatshoar

In this paper, we design a new iterative low-complexity algorithm for computing the Walsh-Hadamard transform (WHT) of an N dimensional signal with a K-sparse WHT. We suppose that N is a power of two and K = O(N^α), scales sub-linearly in N for some α ∈ (0, ...

Institute of Electrical and Electronics Engineers2015

Decoupled dq-Current Control of Grid-Tied Voltage Source Converters Using Nonparametric Models

Alfred Rufer, Alireza Karimi, Behrooz Bahrani

This paper presents a vector control strategy for regulating the current of grid-tied voltage source converters (VSCs) in a rotating reference frame. The proposed approach is based on shaping the open-loop and closed-loop transfer matrices of the system. S ...

Institute of Electrical and Electronics Engineers2013

Weighted Averages and Double Exponential Algorithms

Juan Ramon Mosig

This paper reviews two simple numerical algorithms particularly useful in Computational ElectroMagnetics (CEM): the Weighted Averages (WA) algorithm and the Double Exponential (DE) quadrature. After a short historical introduction and an elementary descrip ...

Ieice-Inst Electronics Information Communications Eng2013

Energy system design under uncertainty

Matthias Dubuis

The current context leads energy system design to very demanding objectives, due to their variety. Indeed, despite an increasing energy demand, environment indicators are becoming always more important. So that for a given service, emission (and then assoc ...

EPFL2012