We consider the problem of testing whether the intersection of a collection of k automata is empty. The straightforward algorithm for solving this problem runs in time k where is...
George Karakostas, Richard J. Lipton, Anastasios V...
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
In this paper we produce complexity and impossibility results and develop algorithms for a task allocation problem that needs to be solved by a group of autonomous agents working ...
Abstract— Space Division Multiple Access (SDMA) is a promising solution to improve the spectral efficiency of future mobile radio systems. However, finding the group of MSs tha...
Adaptive multiagent algorithms based upon the behaviour of social insects are powerful decentralised systems capable of solving complex problems. The intelligence of such a system ...