Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Recent developments in pandora's box problem: Variants and applications
H Beyhaghi, L Cai - ACM SIGecom Exchanges, 2024 - dl.acm.org
In 1979, Weitzman introduced Pandora's box problem as a framework for sequential search
with costly inspections. Recently, there has been a surge of interest in Pandora's box …
with costly inspections. Recently, there has been a surge of interest in Pandora's box …
Optimal robustness-consistency trade-offs for learning-augmented online algorithms
We study the problem of improving the performance of online algorithms by incorporating
machine-learned predictions. The goal is to design algorithms that are both consistent and …
machine-learned predictions. The goal is to design algorithms that are both consistent and …
Learnable and instance-robust predictions for online matching, flows and load balancing
We propose a new model for augmenting algorithms with predictions by requiring that they
are formally learnable and instance robust. Learnability ensures that predictions can be …
are formally learnable and instance robust. Learnability ensures that predictions can be …
How much data is sufficient to learn high-performing algorithms? generalization guarantees for data-driven algorithm design
Algorithms often have tunable parameters that impact performance metrics such as runtime
and solution quality. For many algorithms used in practice, no parameter settings admit …
and solution quality. For many algorithms used in practice, no parameter settings admit …
Prophet secretary against the online optimal
We study the prophet secretary problem, a well-studied variant of the classic prophet
inequality, where values are drawn from independent known distributions but arrive in …
inequality, where values are drawn from independent known distributions but arrive in …
Robustification of online graph exploration methods
Exploring unknown environments is a fundamental task in many domains, eg, robot
navigation, network security, and internet search. We initiate the study of a learning …
navigation, network security, and internet search. We initiate the study of a learning …
Efficient approximation schemes for stochastic probing and prophet problems
Our main contribution is a general framework to design efficient polynomial time
approximation schemes (EPTAS) for fundamental stochastic combinatorial optimization …
approximation schemes (EPTAS) for fundamental stochastic combinatorial optimization …
Faster matchings via learned duals
A recent line of research investigates how algorithms can be augmented with machine-
learned predictions to overcome worst case lower bounds. This area has revealed …
learned predictions to overcome worst case lower bounds. This area has revealed …
Pandora's problem with nonobligatory inspection: Optimal structure and a PTAS
Weitzman (1979) introduced Pandora's box problem as a mathematical model of sequential
search with inspection costs, in which a searcher is allowed to select a prize from one of n …
search with inspection costs, in which a searcher is allowed to select a prize from one of n …
Pandora's box problem with order constraints
The Pandora's Box Problem, originally formalized by Weitzman in 1979, models selection
from a set of options each with stochastic parameters, when evaluation (ie sampling) is …
from a set of options each with stochastic parameters, when evaluation (ie sampling) is …