Abstract Hume is a domain-specific programming language targeting resourcebounded computations. It is based on generalised concurrent bounded automata, controlled by transitions c...
A dominating set D of a graph G = (V, E) is a subset of vertices such that every vertex in V \ D has at least one neighbour in D. Moreover if D is an independent set, i.e. no verti...
: This research proposal introduces an approach for Semantic Web Services that includes context information when querying a service. Thereby, a mapping between context information ...
Motivated by an application in highway pricing, we consider the problem that consists in setting profit-maximizing tolls on a clique subset of a multicommodity transportation net...
We consider a scenario in which anonymous, finite-state sensing devices are deployed in an ad-hoc communication network of arbitrary size and unknown topology, and explore what p...
Dana Angluin, James Aspnes, Melody Chan, Michael J...