1026 search results - page 21 / 206 » On Finding Minimal w-cutset |
158
click to vote
EPS
1998
Springer
15 years 9 months ago
1998
Springer
The task of finding minimal elements of a partially ordered set is a generalization of the task of finding the global minimum of a real-valued function or of finding Pareto-optimal...
105
click to vote
STOC
2007
ACM
16 years 5 months ago
2007
ACM
We give a randomized bi-criteria algorithm for the problem of finding a k-dimensional subspace that minimizes the Lp-error for given points, i.e., p-th root of the sum of p-th
163
click to vote
ISAAC
1997
Springer
15 years 9 months ago
1997
Springer
We give algorithms to find the optimal disjoint paths around a rectangle. The set of disjoint paths connects a set of sources to a set of sinks (no fixed pairing between the sour...
116
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We suggest an approach for the enumeration of minimal permutations having d descents which uses skew Young tableaux. We succeed in finding a general expression for the number of s...
138
Voted
EUC
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We have presented an optimal algorithm for minimal cost loop problem (MCLP), which consists of finding a set of minimum cost loops rooted at a source node. In the MCLP, t...