Deploying battery swap stations for shared electric vehicles using trajectory data

X Yang, C Shao, C Zhuge, M Sun, P Wang… - … Research Part D …, 2021 - Elsevier
This paper proposed a novel Station-to-Point (S2P) Battery Swap Mode for Shared Electric
Vehicles (SEVs), under which Battery Swap Stations (BSSs) have dedicated delivery …

[BOEK][B] Algorithms and theory of computation handbook, volume 2: special topics and techniques

MJ Atallah, M Blanton - 2009 - books.google.com
This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …

[BOEK][B] Deterministic network calculus: From theory to practical implementation

A Bouillard, M Boyer, E Le Corronc - 2018 - books.google.com
Deterministic network calculus is a theory based on the (min, plus) algebra. Its aim is to
compute worst-case performance bounds in communication networks. Our goal is to provide …

Universal-stability results and performance bounds for greedy contention-resolution protocols

M Andrews, B Awerbuch, A Fernández… - Journal of the ACM …, 2001 - dl.acm.org
In this paper, we analyze the behavior of packet-switched communication networks in which
packets arrive dynamically at the nodes and are routed in discrete time steps across the …

Robust queueing theory

C Bandi, D Bertsimas, N Youssef - Operations Research, 2015 - pubsonline.informs.org
We propose an alternative approach for studying queues based on robust optimization. We
model the uncertainty in the arrivals and services via polyhedral uncertainty sets, which are …

Adversarial contention resolution for simple channels

MA Bender, M Farach-Colton, S He… - Proceedings of the …, 2005 - dl.acm.org
This paper analyzes the worst-case performance of randomized backoff on simple multiple-
access channels. Most previous analysis of backoff has assumed a statistical arrival model …

Stable blockchain sharding under adversarial transaction generation

R Adhikari, C Busch, DR Kowalski - … of the 36th ACM Symposium on …, 2024 - dl.acm.org
Sharding is used to improve the scalability and performance of blockchain systems. We
investigate the stability of blockchain sharding, where transactions are continuously …

The price of anarchy of strategic queuing systems

J Gaitonde, É Tardos - Journal of the ACM, 2023 - dl.acm.org
Bounding the price of anarchy, which quantifies the damage to social welfare due to selfish
behavior of the participants, has been an important area of research in algorithmic game …

Tight performance bounds in the worst-case analysis of feed-forward networks

A Bouillard, L Jouhet, E Thierry - 2010 Proceedings IEEE …, 2010 - ieeexplore.ieee.org
Network Calculus theory aims at evaluating worst-case performances in communication
networks. It provides methods to analyze models where the traffic and the services are …

Stability and learning in strategic queuing systems

J Gaitonde, É Tardos - Proceedings of the 21st ACM Conference on …, 2020 - dl.acm.org
Bounding the price of anarchy, which quantifies the damage to social welfare due to selfish
behavior of the participants, has been an important area of research in algorithmic game …