199 search results - page 7 / 40 » On some Algorithmic Problems for Groups and Monoids |
SODA
2010
ACM
14 years 6 months ago
2010
ACM
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...
ICTAI
2010
IEEE
13 years 6 months ago
2010
IEEE
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 ...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
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...
FOCM
2008
13 years 8 months ago
2008
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...
NGC
2001
Springer
14 years 1 months ago
2001
Springer
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 ...