Concept
Best, worst and average case
Publications associées (115)
A ride time-oriented scheduling algorithm for dial-a-ride problems
Nikolaos Geroliminis, Claudia Bongiovanni, Mor Kaspi
This paper offers a new algorithm to efficiently optimize scheduling decisions for dial-a-ride problems (DARPs), including problem variants considering electric and autonomous vehicles (e-ADARPs). The scheduling heuristic, based on linear programming theor ...
Pergamon-Elsevier Science Ltd2024Efficient and Accurate Handling of Periodic Flows in Time-Sensitive Networks
Jean-Yves Le Boudec, Seyed Mohammadhossein Tabatabaee
Total Flow Analysis (TFA) is a method for the worst-case analysis of time-sensitive networks. It uses service curve characterizations of the network nodes and arrival curves of flows at their sources; for tractability, the latter are often taken to be line ...
2023Revisiting adversarial training for the worst-performing class
Volkan Cevher, Grigorios Chrysos, Thomas Michaelsen Pethick
Despite progress in adversarial training (AT), there is a substantial gap between the topperforming and worst-performing classes in many datasets. For example, on CIFAR10, the accuracies for the best and worst classes are 74% and 23%, respectively. We argu ...
2023Byzantine consensus is Θ(n^2): the Dolev-Reischuk bound is tight even in partial synchrony!
Rachid Guerraoui, Jovan Komatovic, Pierre Philippe Civit, Manuel José Ribeiro Vidigueira, Vincent Gramoli, Seth Gilbert
The Dolev-Reischuk bound says that any deterministic Byzantine consensus protocol has (at least) quadratic (in the number of processes) communication complexity in the worst case: given a system with n processes and at most f < n/3 failures, any solution t ...
2023