The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...
A significant body of work in multiagent systems over more than two decades has focused on multi-agent coordination (1). Many challenges in multi-agent coordination can be modeled ...
We investigate a bi-variate probabilistic model-building GA for the graph bipartitioning problem. The graph bipartitioning problem is a grouping problem that requires some modifi...
In this paper, we consider some matrix subgroups of the general linear group and in particular the special linear group that are defined by a quadratic matrix identity. The Lie al...
Anthony M. Bloch, Peter E. Crouch, Jerrold E. Mars...
IP multicast suffers from scalability problems for large numbers of multicast groups, since each router keeps forwarding state proportional to the number of multicast tree passing ...
Aiguo Fei, Jun-Hong Cui, Mario Gerla, Michalis Fal...