Concept

Arbre AVL

Publications associées (49)

From trees to barcodes and back again II: Combinatorial and probabilistic aspects of a topological inverse problem

Kathryn Hess Bellwald, Lida Kanari, Adélie Eliane Garin

In this paper we consider two aspects of the inverse problem of how to construct merge trees realizing a given barcode. Much of our investigation exploits a recently discovered connection between the symmetric group and barcodes in general position, based ...

2024

A general framework to evaluate different rebalancing operations strategies in one-way car sharing systems

Michel Bierlaire, Nikola Obrenovic, Selin Ataç

Car sharing systems (CSSs) are one of the environmentally beneficial solutions in urban transportation. However, the operators still struggle to make these systems profitable. One of the main contributors in operational cost is rebalancing operations. Ther ...

Springer2023

The splay-list: a distribution-adaptive concurrent skip-list

Amirkeivan Mohtashami, Dan Alistarh

The design and implementation of efficient concurrent data structures has seen significant attention. However, most of this work has focused on concurrent data structures providing good worst-case guarantees, although, in real workloads, objects are often ...

SPRINGER2023

Demand-based operations of vehicle sharing systems

Selin Ataç

Vehicle sharing systems (VSSs) allow users to rent vehicles for a short period of time, in a more flexible and convenient manner compared to the traditional vehicle rental services. The long-term VSS subscription replaces the need for contract signing for ...

EPFL2023

Beyond Local Optimality of Buffer and Splitter Insertion for AQFP Circuits

Giovanni De Micheli, Heinz Riener, Siang-Yun Lee

Adiabatic quantum-flux parametron (AQFP) is an energy-efficient superconducting technology. Buffer and splitter (B/S) cells must be inserted to an AQFP circuit to meet the technology-imposed constraints on path balancing and fanout branching. These cells a ...

ACM2022

Metric dimension of critical Galton–Watson trees and linear preferential attachment trees

Gergely Odor

The metric dimension of a graph G is the minimal size of a subset R of vertices of G that, upon reporting their graph distance from a distinguished (source) vertex v⋆, enable unique identification of the source vertex v⋆ among all possible vertices of G. I ...

2021

Vehicle sharing systems: Does demand forecasting yield a better service?

Michel Bierlaire, Nikola Obrenovic, Selin Ataç

Although the idea of vehicle sharing systems (VSSs) emerges back in 1940s, sustaining such a system became simpler with the improvements in technology in the past decade. In addition to that, people have become more concerned about environmental effects an ...

2020

Bike Sharing Systems: Does demand forecasting yield a better service?

Michel Bierlaire, Nikola Obrenovic, Selin Ataç

Although the idea of vehicle sharing systems (VSSs) emerged back in 1940s, sustaining such a system became simpler with the improvements in technology in the past decade. In addition to that, people have become more concerned about environmental effects an ...

2020

Dynamic optimization of bicycle-sharing systems

Mohamed Detsouli

Bicycle-sharing systems stations are often imbalanced. Stations are said to be in excess when there is no empty dock for users willing to deposit their bicycle. Conversely, stations aresaidtobeinshortagewhenthereisnoavailablebicycle. Rebalancingcanbeachiev ...

2020

Analysis of the value of demand forecasting within vehicle sharing systems

Jasso Espadaler Clapés

Vehicle sharing systems (VSSs) are becoming increasingly popular, primarily due to their financial and environmental advantages. However, VSSs face many operational challenges, including inventory management of vehicles and parking spots, vehicle load bala ...

2019

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