Concept

Average-case complexity

Related publications (32)

A Comparative Analysis of Tools & Task Types for Measuring Computational Problem-Solving

Richard Lee Davis, Engin Walter Bumbacher, Jérôme Guillaume Brender

How to measure students' Computational Problem-Solving (CPS) competencies is an ongoing research topic. Prevalent approaches vary by measurement tools (e.g., interactive programming, multiple-choice tests, or programming-independent tests) and task types ( ...

Association for Computing Machinery2024

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 Ltd2024

Randomized low-rank approximation and its applications

Ulf David Persson

In this thesis we will present and analyze randomized algorithms for numerical linear algebra problems. An important theme in this thesis is randomized low-rank approximation. In particular, we will study randomized low-rank approximation of matrix functio ...

EPFL2024

Attenuated Self-Interference Synchrophasor Estimation: the SOGI Interpolated DFT

Mario Paolone, Cesar Garcia Veloso

In this paper, a synchrophasor estimation (SE) algorithm is presented to simultaneously comply with the requirements for the P and M phasor measurement unit (PMU) performance classes. The method employs a second-order generalized integrator (SOGI) quadratu ...

IEEE2023

Unbiasing time-dependent Variational Monte Carlo by projected quantum evolution

Giuseppe Carleo, Clemens Giuliani, Alessandro Sinibaldi, Filippo Vicentini

We analyze the accuracy and sample complexity of variational Monte Carlo approaches to simulate the dynamics of many-body quantum systems classically. By systematically studying the relevant stochastic estimators, we are able to: (i) prove that the most us ...

Wien2023

Efficient 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 ...

2023

Beyond worst-case analysis, with or without predictions

Andreas Maggiori

In this thesis we design online combinatorial optimization algorithms for beyond worst-case analysis settings.In the first part, we discuss the online matching problem and prove that, in the edge arrival model, no online algorithm can achieve a competitive ...

EPFL2023

Exploring the effectiveness of using internal CNC system signals for chatter detection in milling process

Xiaochen Zheng, Roberto Pérez

Chatter is a harmful self-excited vibration that commonly occurs during milling processes. Data -driven chatter detection and prediction is critical to achieve high surface quality and process efficiency. Most existing chatter detection approaches are base ...

ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD2023

Byzantine consensus is Θ(n^2): the Dolev-Reischuk bound is tight even in partial synchrony!

Rachid Guerraoui, Jovan Komatovic, Pierre Philippe Civit, Vincent Gramoli, Seth Gilbert, Manuel José Ribeiro Vidigueira

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

Price discrimination with robust beliefs

Thomas Alois Weber, Jun Han

This paper considers the problem of second-degree price discrimination when the type distribution is unknown or imperfectly specified by means of an ambiguity set. As robustness measure we use a performance index, equivalent to relative regret, which quant ...

2023

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.