In this paper, we consider the wireless sensor network in which the power of each sensor is
adjustable. Given a set of sensors and a set of targets, we study a problem of minimizing the …

This paper studies the minimum power partial multi-cover problem on a line (MinPowPMC-
Line), the goal of which is to find an assignment of powers to sensors such that at least a …

We consider the problem of covering multiple submodular constraints. Given a finite ground
set N, a weight function w: N→ R+, r monotone submodular functions f 1, f 2,…, fr over N and …

Abstract Partial Vertex Cover is a well-studied generalization of the classic Vertex Cover
problem, where we are given a graph G=(V, E) along with a non-negative integer k, and the …

The joint replenishment problem (JRP) is a classical inventory management problem. We
consider a natural generalization with outliers, where we are allowed to reject (that is, not …

Software Hardening against memory safety exploits can be achieved from the silicon, up to
the software, with both compilers and operating systems features. Unfortunately, due to the …

Electron beam inspection (EBI) with high resolution is a promising technique to improve the
defect inspection on the surface of patterned wafer. However, high resolution usually means …

Purpose The paper aims to provide an efficient meta-heuristic algorithm to solve the partial
set covering problem (PSCP). With rich application scenarios, the PSCP is a fascinating and …

We tackle the question of checking hypotheses on user data. In particular, we address the
challenges that arise in the context of testing an input hypothesis on many data samples, in …

Les données des utilisateurs deviennent de plus en plus disponibles dans plusieurs
domaines, allant des plateformes de commerce électronique aux réseaux sociaux. Elles …