9842 search results - page 195 / 1969 » The Complexity of the Matching-Cut Problem |
GECCO
2006
Springer
14 years 2 months ago
2006
Springer
In this paper, we address the problem of finding gene regulatory networks from experimental DNA microarray data. We focus on the evaluation of the performance of different evoluti...
KDD
2010
ACM
14 years 10 days ago
2010
ACM
The fused Lasso penalty enforces sparsity in both the coefficients and their successive differences, which is desirable for applications with features ordered in some meaningful w...
AAAI
1990
13 years 11 months ago
1990
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
EOR
2002
13 years 10 months ago
2002
In multistage cutting stock problems (CSP) the cutting process is distributed over several successive stages. Every stage except the last one produces intermediate products. The l...