4110 search results - page 25 / 822 » Efficient algorithms for the 2-gathering problem |
118
Voted
TPDS
1998
15 years 3 months ago
1998
—A matrix A of size m n containing items from a totally ordered universe is termed monotone if, for every i, j, 1 i < j m, the minimum value in row j lies below or to...
103
Voted
TPDS
2008
15 years 3 months ago
2008
We consider the Continuous Delivery Message Dissemination (CDMD) problem over the n-processor single-port complete (all links are present and are bidirectional) static network with...
133
Voted
CEC
2007
IEEE
15 years 10 months ago
2007
IEEE
—Genetic Algorithms (GAs) have a good potential of solving the Gate Assignment Problem (GAP) at airport terminals, and the design of feasible and efficient evolutionary operators...
125
Voted
STACS
2010
Springer
15 years 10 months ago
2010
Springer
In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved effi...
