Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Computational bounds on randomized algorithms for online bin stretching
A Lhomme, N Catusse, N Brauner - arxiv preprint arxiv:2405.19071, 2024 - arxiv.org
A frequently studied performance measure in online optimization is competitive analysis. It
corresponds to the worst-case ratio, over all possible inputs of an algorithm, between the …
corresponds to the worst-case ratio, over all possible inputs of an algorithm, between the …
Improved online load balancing with known makespan
M Böhm, M Lieskovský, S Schmitt, J Sgall… - arxiv preprint arxiv …, 2024 - arxiv.org
We break the barrier of $3/2$ for the problem of online load balancing with known
makespan, also known as bin stretching. In this problem, $ m $ identical machines and the …
makespan, also known as bin stretching. In this problem, $ m $ identical machines and the …
Online bin stretching lower bounds: Improved search of computational proofs
A Lhomme, O Romane, N Catusse… - arxiv preprint arxiv …, 2022 - arxiv.org
Computing lower and upper bounds on the competitive ratio of online algorithms is a
challenging question: For a minimization combinatorial problem, proving a competitive ratio …
challenging question: For a minimization combinatorial problem, proving a competitive ratio …
Better algorithms for online bin stretching via computer search
M Lieskovský - Latin American Symposium on Theoretical Informatics, 2024 - Springer
Abstract Online Bin Stretching is a problem closely related to Online Bin Packing and
various scheduling problems. There is extensive history of computer search being used to …
various scheduling problems. There is extensive history of computer search being used to …
Formalizing algorithmic bounds in the query model in easycrypt
A Stoughton, C Chen, M Gaboardi, W Qu - … international proceedings in …, 2022 - par.nsf.gov
We use the EasyCrypt proof assistant to formalize the adversarial approach to proving lower
bounds for computational problems in the query model. This is done using a lower bound …
bounds for computational problems in the query model. This is done using a lower bound …