Publications associées à Satisficing measure approach for vehicle routing problem with time windows under uncertainty

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Sublinear Bounds on the Distinguishing Advantage for Multiple Samples

Serge Vaudenay

The maximal achievable advantage of a (computationally unbounded) distinguisher to determine whether a source

Z

is distributed according to distribution

P_0

P_1

, when given access to one sample of

Z

, is characterized by the statistical distance ...

Springer, Cham2020

Satisficing measure approach for vehicle routing problem with time windows under uncertainty

Graph Chatbot

Chattez avec Graph Search

Beyond fine-tuning: LoRA modules boost near-OOD detection and LLM security

Beyond fine-tuning: LoRA modules boost near-OOD detection and LLM security

On the Use of Benford’s Law to Assess the Quality of the Data Provided by Lightning Locating Systems

The Importance of Modeling Data Missingness in Algorithmic Fairness: A Causal Perspective

Sublinear Bounds on the Distinguishing Advantage for Multiple Samples

Scalable Stochastic Optimization: Scenario Reduction with Guarantees

Statistical Aspects of Wasserstein Distances

The electric autonomous dial-a-ride problem

Scenario Reduction Revisited: Fundamental Limits and Guarantees

The online electric autonomous dial-a-ride problem

Beyond fine-tuning: LoRA modules boost near-OOD detection and LLM security

Beyond fine-tuning: LoRA modules boost near-OOD detection and LLM security

The Importance of Modeling Data Missingness in Algorithmic Fairness: A Causal Perspective

The online electric autonomous dial-a-ride problem

On the Use of Benford’s Law to Assess the Quality of the Data Provided by Lightning Locating Systems

Sublinear Bounds on the Distinguishing Advantage for Multiple Samples

The electric autonomous dial-a-ride problem

Scenario Reduction Revisited: Fundamental Limits and Guarantees

Scalable Stochastic Optimization: Scenario Reduction with Guarantees

Statistical Aspects of Wasserstein Distances