We present efficient approximation algorithms for a number of problems that call for computing the prices that maximize the revenue of the seller on a set of items. Algorithms for ...
The problem of optimal node density maximizing the Neyman-Pearson detection error exponent subject to a constraint on average (per node) energy consumption is analyzed. The spatial...
The problem of decision fusion in a large wireless sensor system with many power-constrained distributed nodes is considered. The sensor network is assumed to be inhomogeneous. i....
In this paper we propose a Bayesian framework for XCS [9], called BXCS. Following [4], we use probability distributions to represent the uncertainty over the classifier estimates ...
Davide Aliprandi, Alex Mancastroppa, Matteo Matteu...
We study a deployment strategy for a group of vehicles that drift in an ambient flow field. Specifically, we address the case where the flow is always greater in magnitude than an ...