Concept

Théorème flot-max/coupe-min

Publications associées (106)

Gondo Throttled Surge Tank Numerical Modeling and Design Review

In order to increase the installed capacity, the refurbishment of Gondo high-head power plant required a modification of the existing surge tank by installing a throttle at its entrance. In a previous study, the geometry of this throttle was optimized by p ...

2020

Distributed Coupled Multiagent Stochastic Optimization

Ali H. Sayed, Sulaiman A S A E Alghunaim

This paper develops an effective distributed strategy for the solution of constrained multiagent stochastic optimization problems with coupled parameters across the agents. In this formulation, each agent is influenced by only a subset of the entries of a ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Effect of 30-Degree Sloping Smooth and Stepped Chute Approach Flow on the Performance of a Classical Stilling Basin

Anton Schleiss, Michael Pfister, José Pedro Gamito de Saldanha Calado Matos, Ivan Stojnic

Advances in dam construction techniques have significantly increased the number of stepped spillways implemented worldwide. Although stepped chutes provide enhanced energy dissipation along the chute, as compared to smooth chutes, an adequate energy dissip ...

2020

Reconfigurable microfluidics: real-time shaping of virtual channels through hydrodynamic forces

David Philipp Taylor

To break the current paradigm in microfluidics that directly links device design to functionality, we introduce microfluidic "virtual channels" that can be dynamically shaped in real-time. A virtual channel refers to a flow path within a microfluidic flow ...

2020

Memory Efficient Max Flow for Multi-Label Submodular MRFs

Mathieu Salzmann

Multi-label submodular Markov Random Fields (MRFs) have been shown to be solvable using max-flow based on an encoding of the labels proposed by Ishikawa, in which each variable X-i is represented by l nodes (where l is the number of labels) arranged in a c ...

2019

An Optimal Space Lower Bound for Approximating MAX-CUT

Mikhail Kapralov

We consider the problem of estimating the value of MAX-CUT in a graph in the streaming model of computation. At one extreme, there is a trivial 2-approximation for this problem that uses only O(log n) space, namely, count the number of edges and output hal ...

ASSOC COMPUTING MACHINERY2019

Numerical Approximation Of Orthogonal Maps

Marco Picasso, Alexandre Caboussat, Dimitrios Gourzoulidis

Orthogonal maps are the solutions of the mathematical model of paper-folding, also called the origami problem. They consist of a system of first-order fully nonlinear equations involving the gradient of the solution. The Dirichlet problem for orthogonal ma ...

2019

New Notions and Constructions of Sparsification for Graphs and Hypergraphs

Ola Nils Anders Svensson

A sparsifier of a graph G (Bencztir and Karger; Spielman and Teng) is a sparse weighted subgraph (G) over tilde that approximately retains the same cut structure of G. For general graphs, non-trivial sparsification is possible only by using weighted graphs ...

IEEE COMPUTER SOC2019

Artificial floods in residual flow reaches – How do they affect hydraulic habitats

Severin Stähly

Floodplains in hydropower-controlled rivers, where a constant residual flow discharge is imposed, often lack sediment supply and periodic inundation due to the absence of natural flood events. In this study we compare two residual flow systems. The first r ...

2019

SD-WISE: A Software-Defined WIreless SEnsor network

Angelos Christos Anadiotis

In this paper we introduce SD-WISE, a Software-Defined Wireless SEnsor networking solution for Wireless Sensor (and actuator) Networks (WSNs). SD-WISE has several unique features making it a flexible and expandable solution that can be applied in heterogen ...

ELSEVIER SCIENCE BV2019

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