849 search results - page 11 / 170 » On the Complexity of the Whitehead Minimization Problem |
ATAL
2003
Springer
14 years 28 days ago
2003
Springer
In complex distributed applications, a problem is often decomposed into a set of subproblems that are distributed to multiple agents. We formulate this class of problems with a tw...
HIPC
2003
Springer
14 years 28 days ago
2003
Springer
Delay and jitter management in high performance active computation is a challenging problem in the emerging area of internet computing. The problem takes a complex new form from it...
TCOM
2011
13 years 2 months ago
2011
—Minimizing the sum of mean squared errors using linear transceivers under a sum power constraint in the multiuser downlink is a non-convex problem. Existing algorithms exploit a...
IJFCS
2007
13 years 7 months ago
2007
We extend an algorithm by Paige and Tarjan that solves the coarsest stable refinement problem to the domain of trees. The algorithm is used to minimize non-deterministic tree auto...
ISAAC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We consider the problems of hypergraph and minor crossing minimization, and point out a relation between these two problems which has not been exploited before. We presen...