Reconstructing Loopy Curvilinear Structures Using Integer Programming

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.

Omnichannel retail has emerged as the new standard in today's commerce landscape, with retailers integrating their physical and online channels to enhance the customer shopping experience. However, such integration presents significant challenges for retai ...

The log law of the wall, joining the inner, near-wall mean velocity profile (MVP) in wall-bounded turbulent flows to the outer region, has been a permanent fixture of turbulence research for over hundred years, but there is still no general agreement on th ...

Designing structures from reused elements is becoming an increasingly important design task for structural engineers as it has potential to significantly reduce adverse environmental impacts of building structures. To allow for a broad application of this ...

Time-sensitive networks, as in the context of IEEE Time-Sensitive Networking (TSN) and IETF Deterministic Networking (DetNet), offer deterministic services with guaranteed bounded latency in order to support safety-critical applications. In this thesis, we ...

The task of optimally designing and scheduling energy systems with a high share of renewable energies is complex and computationally demanding. A widespread method for tackling this task is to apply mixed integer linear programming (MILP). Even though the ...

Collaborative learning algorithms, such as distributed SGD (or D-SGD), are prone to faulty machines that may deviate from their prescribed algorithm because of software or hardware bugs, poisoned data or malicious behaviors. While many solutions have been ...

In many transportation systems, a mismatch between the associated design and planning decisions and the demand is typically encountered. A tailored system is not only appealing to operators, which could have a better knowledge of their operational costs, b ...

We consider the problem of solving integer programs of the form min {c^⊺ x : Ax = b, x ∈ ℤ_{⩾ 0}}, where A is a multistage stochastic matrix in the following sense: the primal treedepth of A is bounded by a parameter d, which means that the columns of A ca ...

In this work, we develop timing-driven CAD support for FPGA architectures with direct connections between LUTs. We do so by proposing an efficient ILP-based detailed placer, which moves a carefully selected subset of LUTs from their original positions, so ...

Spatial self-attention layers, in the form of Non-Local blocks, introduce long-range dependencies in Convolutional Neural Networks by computing pairwise similarities among all possible positions. Such pairwise functions underpin the effectiveness of non-lo ...

Enabling analysis of non-linear systems in linear form, the Koopman operator has been shown to be a powerful tool for system identification and controller design. However, current data-driven methods cannot provide quantification of model uncertainty given ...

This work develops new algorithms with rigorous efficiency guarantees for infinite horizon imitation learning (IL) with linear function approximation without restrictive coherence assumptions. We begin with the minimax formulation of the problem and then o ...

Phase synchronizations in models of coupled oscillators such as the Kuramoto model have been widely studied with pairwise couplings on arbitrary topologies, showing many unexpected dynamical behaviors. Here, based on a recent formulation the Kuramoto model ...

Many transportation markets are characterized by oligopolistic competition. In these markets customers, suppliers and regulators make decisions that are influenced by the preferences and the decisions of all other agents. In particular, capturing and under ...

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

Future low-carbon societies will need to store vast amounts of electricity to stabilize electricity grids and to power electric vehicles. Vehicle-to-grid allows vehicle owners and grid operators to share the costs of electricity storage by making the batte ...

During the Artificial Intelligence (AI) revolution of the past decades, deep neural networks have been widely used and have achieved tremendous success in visual recognition. Unfortunately, deploying deep models is challenging because of their huge model s ...

The objective of this thesis is to develop a general methodology to incorporate a disaggregate demand representation in supply-oriented optimization problems that allows to capture the interplay between the behavior of individuals and the decisions to be o ...

This paper reviews the state of the art and discusses recent developments in the field of adaptive isogeometric analysis, with special focus on the mathematical theory. This includes an overview of available spline technologies for the local resolution of ...

Stochastic optimization is a popular modeling paradigm for decision-making under uncertainty and has a wide spectrum of applications in management science, economics and engineering. However, the stochastic optimization models one faces in practice are int ...

Reconstructing Loopy Curvilinear Structures Using Integer Programming

Chattez avec Graph Search

Quantitative Methods for Omnichannel Decision-Making

The hunt for the Karman 'constant' revisited

Computational tool for stock-constrained design of structures

Worst-Case Delay Analysis of Time-Sensitive Networks with Network Calculus

Data reduction for mixed integer linear programming in complex energy systems

Robust Collaborative Learning with Linear Gradient Overhead

Integrating advanced discrete choice models in mixed integer linear optimization

Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity

Detailed Placement for Dedicated LUT-Level FPGA Interconnect

Poly-NL: Linear Complexity Non-local Layers With 3rd Order Polynomials

On Gaussian Process Based Koopman Operators

Proximal Point Imitation Learning

Connecting Hodge and Sakaguchi-Kuramoto through a mathematical framework for coupled oscillators on simplicial complexes

Optimization and equilibrium problems with discrete choice models

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

Vehicle-to-Grid for Reliable Frequency Regulation

Improving the Training of Compact Neural Networks for Visual Recognition

A general framework for the integration of complex choice models into mixed integer optimization

Mathematical Foundations of Adaptive Isogeometric Analysis

Scalable Stochastic Optimization: Scenario Reduction with Guarantees