Concept

Arbre couvrant de poids minimal

Publications associées (211)

A Distributed Augmenting Path Approach for the Bottleneck Assignment Problem

We develop an algorithm to solve the bottleneck assignment problem (BAP) that is amenable to having computation distributed over a network of agents. This consists of exploring how each component of the algorithm can be distributed, with a focus on one com ...

Piscataway2024

Decomposition method to evaluate district heating/cooling network potential at urban scale

François Maréchal, Luc Girardin, Ana Catarina Gouveia Braz, Bingqian Liu, Raphaël Briguet

In this work, a tool to design district heating networks (DHN) is presented and applied to the city of Lausanne as a case study. The evaluation of the buildings’ heat/cooling demand is performed using a Geographic Information System (GIS) database, built f ...

Associazione Italiana Di Ingegneria Chimica2024

A WIM-Based Assessment of Multiple Vehicle Presence Effects on Fatigue Damage of Highway Bridges

Alain Nussbaumer, Scott Walbridge, Matthew James Sjaarda

The fatigue provisions for bridge design in North America and Europe are highly simplified for the sake of practical implementation, in comparison with the state of the art in understanding of the true fatigue behavior. Historically, one significant simpli ...

2024

Distributed Optimization with Byzantine Robustness Guarantees

Lie He

As modern machine learning continues to achieve unprecedented benchmarks, the resource demands to train these advanced models grow drastically. This has led to a paradigm shift towards distributed training. However, the presence of adversariesâwhether ma ...

EPFL2023

Approximation Algorithms for Allocation and Network Design

Etienne Michel François Bamas

In this thesis, we give new approximation algorithms for some NP-hard problems arising in resource allocation and network design. As a resource allocation problem, we study the Santa Claus problem (also known as the MaxMin Fair Allocation problem) in which ...

EPFL2023

Multi-agent Reinforcement Learning for Assembly of a Spanning Structure

Gabriel Rémi Vallat

In this master thesis, multi-agent reinforcement learning is used to teach robots to build a self-supporting structure connecting two points. To accomplish this task, a physics simulator is first designed using linear programming. Then, the task of buildin ...

2023

AIFORE: Smart Fuzzing Based on Automatic Input Format Reverse Engineering

Mathias Josef Payer, Zhiyao Feng, Chunmin Zhang, Ji Shi

Knowledge of a program's input format is essential for effective input generation in fuzzing. Automated input format reverse engineering represents an attractive but challenging approach to learning the format. In this paper, we address several challenges ...

Berkeley2023

Portable impedance-sensing device for microorganism characterization in the field

Sandro Carrara, Karim Bouzid

A variety of biosensors have been proposed to quickly detect and measure the properties of individual microorganisms among heterogeneous populations, but challenges related to cost, portability, stability, sensitivity, and power consumption limit their app ...

NATURE PORTFOLIO2023

Communication-efficient distributed training of machine learning models

Thijs Vogels

In this thesis, we explore techniques for addressing the communication bottleneck in data-parallel distributed training of deep learning models. We investigate algorithms that either reduce the size of the messages that are exchanged between workers, or th ...

EPFL2023

Dimensionality reduction of time-series data, and systems and devices that use the resultant embeddings

Steffen Schneider

Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for dimensionality reduction of time-series using contrastive learning. A method can include receiving multidimensional input time series data that includes ...

2023

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