A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...
Abstract--In the past few years, the problem of distributed consensus has received a lot of attention, particularly in the framework of ad hoc sensor networks. Most methods propose...
Social awareness applications are based on the idea of a group sharing real-time context information via personal and ubiquitous terminals. Studies of such applications have shown ...
In this paper we present the robot programming and planning language Readylog, a Golog dialect which was developed to support the decision making of robots acting in dynamic real-...
Applications that rely on mobile devices for user interaction must be mindful of the user's limited attention, which will typically be split between several competing tasks. C...
Stephen Knox, Ross Shannon, Lorcan Coyle, Adrian K...