42 citations
- Centre National de la Recherche ScientifiqueFR4 papers
- Sorbonne UniversitéFR2 papers
- Carnegie Mellon UniversityUS1 paper
- Centre d'études et de recherche en informatique et communicationsFR1 paper
- Charles UniversityCZ1 paper
- Chinese University of Hong KongHK1 paper
- Corvinus University of BudapestHU1 paper
- Decision ResearchUS1 paper
- Decision Sciences (United States)US1 paper
- Decision Systems (United States)US1 paper
- Département d'InformatiqueFR1 paper
- École Normale Supérieure - PSLFR1 paper
5 papers · 1 filter
Online Search with Maximum Clearance
Spyros Angelopoulos, Malachi Voss
We study the setting in which a mobile agent must locate a hidden target in a bounded or unbounded environment, with no information about the hider's position. In particular, we co…
Periodic Scheduling and Packing Problems
Claire Hanen, Zdenek Hanzalek
This paper is motivated by periodic data transmission in autonomous cars. We considered periodic tasks (with different periods) on one or several machines. After reviewing the lite…
Black-Box Optimization Revisited: Improving Algorithm Selection Wizards through Massive Benchmarking
Laurent Meunier, Herilalaina Rakotoarison, Pak Kan Wong +5
Existing studies in black-box optimization for machine learning suffer from low generalizability, caused by a typically selective choice of problem instances used for training and…
Polynomial Time Approximation Schemes for Clustering in Low Highway Dimension Graphs
Andreas Emil Feldmann, David Saulpic
We study clustering problems such as k-Median, k-Means, and Facility Location in graphs of low highway dimension, which is a graph parameter modeling transportation networks. It wa…
On Minimum Dominating Sets in cubic and (claw,H)-free graphs
Valentin Bouquet, François Delbot, Christophe Picouleau +1
Given a graph , is a dominating set if every is adjacent to an element of . The Minimum Dominating Set problem asks for a dominating…