The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
Manish Jain, Christopher Kiekintveld, Milind Tambe
The mean first passage time (MFPT) is calculated for a Brownian particle in a bounded two-dimensional domain that contains N small nonoverlapping absorbing windows on its boundary....
S. Pillay, Michael J. Ward, A. Peirce, Theodore Ko...
Motivated by applications to sensor networks and privacy preserving databases, we consider the problem of functional compression. The objective is to separately compress possibly c...
— We propose a fuzzy-based decision-making mechanism for selecting data dissemination protocols in wireless sensor networks (WSNs). Its goal is to select the most efficient proto...
Revision history provides a rich source of information to improve the understanding of changes made to programs, but it yields only limited insight into how these changes occurred...