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
We explore the task of designing an efficient multi-agent system that is capable of capturing a single moving target, assuming that every agent knows the location of all agents on...
The paper describes initial results in an ongoing project aimed at providing and analyzing standardized, representative data sets for typical context recognition tasks. Such data ...
Ernst A. Heinz, Kai S. Kunze, Stefan Sulistyo, Hol...
For many applications, it is important to evaluate trigger conditions on time series streams. In a resource constrained environment, users’ needs should ultimately decide how th...
In this paper we incorporate autonomous agents' capability to perform parallel interactions into the cooperative search model, resulting in a new method which outperforms the...