Abstract— We consider a distributed multi-agent network system where the goal is to minimize an objective function that can be written as the sum of component functions, each of ...
A demonstration at iGRID 2005 used dynamic, deterministic, and dedicated LightPath network services to link radio telescopes from around the world with computational facilities at...
Jerry Sobieski, Tom Lehman, Bijan Jabbari, Chester...
Abstract. This report presents a generic filtering scheme, based on the graph description of global constraints. This description is defined by a network of binary constraints and ...
Nicolas Beldiceanu, Mats Carlsson, Sophie Demassey...
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
A group of identical mobile agents moving asynchronously among the nodes of an anonymous network have to gather together in a single node of the graph. This problem known as the (a...