In this paper, we analyze the problem of finding a periodic schedule for the wake-up times of a set of nodes in a Wireless Sensor Network that optimizes the coverage of the region...
Daniele Fontanelli, Luigi Palopoli, Roberto Passer...
We propose a classification method based on a decision tree whose nodes consist of linear Support Vector Machines (SVMs). Each node defines a decision hyperplane that classifies p...
For n disjoint line segments in the plane we construct in optimal O(n log n) time and linear space an encompassing tree of maximum degree three such that at every vertex all incid...
Michael Hoffmann, Bettina Speckmann, Csaba D. T&oa...
In the classic multi-armed bandits problem, the goal is to have a policy for dynamically operating arms that each yield stochastic rewards with unknown means. The key metric of int...
This paper introduces a new game theoretic formulation for the design and routing of resilient and translucent networks. An integer linear programming (ILP) modeling is also presen...